./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_opt-floodmax.3.4.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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:31:49,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:31:49,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:31:49,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:31:49,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:31:49,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:31:49,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:31:49,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:31:49,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:31:49,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:31:49,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:31:49,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:31:49,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:31:49,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:31:49,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:31:49,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:31:49,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:31:49,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:31:49,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:31:49,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:31:49,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:31:49,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:31:49,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:31:49,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:31:49,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:31:49,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:31:49,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:31:49,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:31:49,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:31:49,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:31:49,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:31:49,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:31:49,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:31:49,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:31:49,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:31:49,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:31:49,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:31:49,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:31:49,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:31:49,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:31:49,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:31:49,318 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:31:49,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:31:49,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:31:49,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:31:49,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:31:49,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:31:49,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:31:49,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:31:49,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:31:49,338 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:31:49,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:31:49,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:31:49,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:31:49,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:31:49,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:31:49,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:31:49,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:31:49,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:31:49,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:31:49,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:31:49,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:49,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:31:49,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:31:49,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:31:49,343 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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2022-02-20 18:31:49,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:31:49,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:31:49,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:31:49,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:31:49,519 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:31:49,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:49,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa27c8300/d6feaa459b9245de99e561585387ec58/FLAGbf183568c [2022-02-20 18:31:49,968 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:31:49,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:49,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa27c8300/d6feaa459b9245de99e561585387ec58/FLAGbf183568c [2022-02-20 18:31:49,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa27c8300/d6feaa459b9245de99e561585387ec58 [2022-02-20 18:31:49,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:31:49,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:31:49,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:49,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:31:50,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:31:50,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:49" (1/1) ... [2022-02-20 18:31:50,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456036c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50, skipping insertion in model container [2022-02-20 18:31:50,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:31:49" (1/1) ... [2022-02-20 18:31:50,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:31:50,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:31:50,232 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2022-02-20 18:31:50,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:50,244 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:31:50,289 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_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2022-02-20 18:31:50,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:31:50,300 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:31:50,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50 WrapperNode [2022-02-20 18:31:50,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:31:50,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:50,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:31:50,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:31:50,306 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:31:50" (1/1) ... [2022-02-20 18:31:50,312 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:31:50" (1/1) ... [2022-02-20 18:31:50,353 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 479 [2022-02-20 18:31:50,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:31:50,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:31:50,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:31:50,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:31:50,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:31:50,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:31:50,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:31:50,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:31:50,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (1/1) ... [2022-02-20 18:31:50,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:31:50,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:31:50,438 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:31:50,446 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:31:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:31:50,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:31:50,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:31:50,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:31:50,568 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:31:50,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:31:51,023 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:31:51,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:31:51,029 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:31:51,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:51 BoogieIcfgContainer [2022-02-20 18:31:51,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:31:51,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:31:51,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:31:51,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:31:51,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:31:49" (1/3) ... [2022-02-20 18:31:51,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ef1630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:51, skipping insertion in model container [2022-02-20 18:31:51,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:31:50" (2/3) ... [2022-02-20 18:31:51,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ef1630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:31:51, skipping insertion in model container [2022-02-20 18:31:51,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:31:51" (3/3) ... [2022-02-20 18:31:51,036 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2022-02-20 18:31:51,039 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:31:51,039 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:31:51,069 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:31:51,073 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:31:51,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:31:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:31:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:51,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:51,092 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:31:51,092 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times [2022-02-20 18:31:51,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:51,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012083980] [2022-02-20 18:31:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:51,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {152#true} is VALID [2022-02-20 18:31:51,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {152#true} is VALID [2022-02-20 18:31:51,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:31:51,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:31:51,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {152#true} is VALID [2022-02-20 18:31:51,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} init_#res#1 := init_~tmp___5~0#1; {152#true} is VALID [2022-02-20 18:31:51,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {152#true} is VALID [2022-02-20 18:31:51,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {153#false} is VALID [2022-02-20 18:31:51,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:31:51,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {153#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:31:51,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {153#false} assume !(0 != ~mode1~0 % 256); {153#false} is VALID [2022-02-20 18:31:51,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {153#false} assume !(~r1~0 % 256 < 1); {153#false} is VALID [2022-02-20 18:31:51,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:31:51,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {153#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {153#false} is VALID [2022-02-20 18:31:51,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {153#false} assume !(0 != ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:31:51,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {153#false} assume !(~r2~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:31:51,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:31:51,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {153#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {153#false} is VALID [2022-02-20 18:31:51,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {153#false} assume !(0 != ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:31:51,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {153#false} assume !(~r3~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:31:51,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:31:51,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {153#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; {153#false} is VALID [2022-02-20 18:31:51,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#false} is VALID [2022-02-20 18:31:51,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {153#false} check_#res#1 := check_~tmp~1#1; {153#false} is VALID [2022-02-20 18:31:51,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {153#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {153#false} is VALID [2022-02-20 18:31:51,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {153#false} assume 0 == assert_~arg#1 % 256; {153#false} is VALID [2022-02-20 18:31:51,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:31:51,327 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:31:51,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:51,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012083980] [2022-02-20 18:31:51,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012083980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:51,328 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:51,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:31:51,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293218469] [2022-02-20 18:31:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:51,336 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:31:51,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:51,339 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:31:51,373 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:31:51,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:31:51,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:51,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:31:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:31:51,399 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.748299319727891) internal successors, (257), 148 states have internal predecessors, (257), 0 states have call successors, (0), 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:31:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:51,601 INFO L93 Difference]: Finished difference Result 235 states and 403 transitions. [2022-02-20 18:31:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:31:51,602 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:31:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:51,603 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:31:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:31:51,613 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:31:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-20 18:31:51,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions. [2022-02-20 18:31:51,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:51,938 INFO L225 Difference]: With dead ends: 235 [2022-02-20 18:31:51,938 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:31:51,941 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:31:51,945 INFO L933 BasicCegarLoop]: 250 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, 250 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:31:51,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:31:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:31:51,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:51,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:31:51,982 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:31:51,982 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:31:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:51,992 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:31:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:51,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:51,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:51,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:51,999 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:52,007 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2022-02-20 18:31:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:52,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:52,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:52,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:52,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7361111111111112) internal successors, (250), 144 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:31:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 250 transitions. [2022-02-20 18:31:52,021 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 250 transitions. Word has length 37 [2022-02-20 18:31:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:52,022 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 250 transitions. [2022-02-20 18:31:52,022 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:31:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2022-02-20 18:31:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:31:52,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:52,023 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:31:52,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:31:52,023 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times [2022-02-20 18:31:52,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:52,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408229549] [2022-02-20 18:31:52,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:52,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:52,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {853#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {853#true} is VALID [2022-02-20 18:31:52,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {853#true} is VALID [2022-02-20 18:31:52,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {853#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {853#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {853#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {853#true} is VALID [2022-02-20 18:31:52,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {853#true} is VALID [2022-02-20 18:31:52,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-20 18:31:52,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {855#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {856#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:31:52,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {856#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {857#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {854#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {854#false} assume !(0 != ~mode1~0 % 256); {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {854#false} assume !(~r1~0 % 256 < 1); {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {854#false} ~mode1~0 := 1; {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {854#false} assume !(0 != ~mode2~0 % 256); {854#false} is VALID [2022-02-20 18:31:52,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {854#false} assume !(~r2~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {854#false} ~mode2~0 := 1; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {854#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !(0 != ~mode3~0 % 256); {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#false} assume !(~r3~0 % 256 < 2); {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {854#false} ~mode3~0 := 1; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {854#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; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {854#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {854#false} check_#res#1 := check_~tmp~1#1; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {854#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {854#false} is VALID [2022-02-20 18:31:52,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {854#false} assume 0 == assert_~arg#1 % 256; {854#false} is VALID [2022-02-20 18:31:52,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-02-20 18:31:52,125 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:31:52,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:52,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408229549] [2022-02-20 18:31:52,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408229549] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:52,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:52,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:52,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90107121] [2022-02-20 18:31:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:52,126 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:31:52,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:52,127 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:31:52,147 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:31:52,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:52,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:52,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:52,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:52,148 INFO L87 Difference]: Start difference. First operand 145 states and 250 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:31:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:52,548 INFO L93 Difference]: Finished difference Result 234 states and 396 transitions. [2022-02-20 18:31:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:31:52,548 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:31:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:52,548 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:31:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:31:52,551 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:31:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 396 transitions. [2022-02-20 18:31:52,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 396 transitions. [2022-02-20 18:31:52,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:52,772 INFO L225 Difference]: With dead ends: 234 [2022-02-20 18:31:52,772 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 18:31:52,773 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:31:52,774 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:52,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 959 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 18:31:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-02-20 18:31:52,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:52,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:31:52,780 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:31:52,780 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:31:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:52,784 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:31:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:52,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:52,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:52,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:52,785 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 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 145 states. [2022-02-20 18:31:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:52,789 INFO L93 Difference]: Finished difference Result 145 states and 220 transitions. [2022-02-20 18:31:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:52,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:52,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:52,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:52,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.5277777777777777) internal successors, (220), 144 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have 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:31:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 220 transitions. [2022-02-20 18:31:52,793 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 220 transitions. Word has length 37 [2022-02-20 18:31:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:52,794 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 220 transitions. [2022-02-20 18:31:52,794 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:31:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2022-02-20 18:31:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:31:52,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:52,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:52,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:31:52,796 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times [2022-02-20 18:31:52,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:52,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495946153] [2022-02-20 18:31:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:52,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {1560#true} is VALID [2022-02-20 18:31:52,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {1560#true} is VALID [2022-02-20 18:31:52,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {1560#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {1560#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1560#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1560#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1560#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1560#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1560#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1560#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {1560#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1560#true} assume ~id1~0 != ~id2~0; {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {1560#true} assume ~id1~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {1560#true} assume ~id2~0 != ~id3~0; {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {1560#true} assume ~id1~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:52,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {1560#true} assume ~id2~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:52,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {1560#true} assume ~id3~0 >= 0; {1560#true} is VALID [2022-02-20 18:31:52,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {1560#true} assume 0 == ~r1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r122~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r132~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r212~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r232~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r312~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != init_~r322~0#1 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,920 INFO L290 TraceCheckUtils]: 40: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax1~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax2~0 % 256; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} init_#res#1 := init_~tmp___5~0#1; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,923 INFO L290 TraceCheckUtils]: 46: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == assume_abort_if_not_~cond#1); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,923 INFO L290 TraceCheckUtils]: 47: Hoare triple {1562#(<= ~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; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 != ~mode1~0 % 256); {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:31:52,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {1562#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 1); {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {1561#false} ~mode1~0 := 1; {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {1561#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {1561#false} assume !(0 != ~mode2~0 % 256); {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {1561#false} assume !(~r2~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {1561#false} ~mode2~0 := 1; {1561#false} is VALID [2022-02-20 18:31:52,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {1561#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {1561#false} assume !(0 != ~mode3~0 % 256); {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {1561#false} assume !(~r3~0 % 256 < 2); {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {1561#false} ~mode3~0 := 1; {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {1561#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; {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {1561#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {1561#false} is VALID [2022-02-20 18:31:52,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {1561#false} check_#res#1 := check_~tmp~1#1; {1561#false} is VALID [2022-02-20 18:31:52,927 INFO L290 TraceCheckUtils]: 63: Hoare triple {1561#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1561#false} is VALID [2022-02-20 18:31:52,927 INFO L290 TraceCheckUtils]: 64: Hoare triple {1561#false} assume 0 == assert_~arg#1 % 256; {1561#false} is VALID [2022-02-20 18:31:52,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-02-20 18:31:52,927 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:31:52,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:52,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495946153] [2022-02-20 18:31:52,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495946153] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:52,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:52,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:52,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361522875] [2022-02-20 18:31:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:31:52,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:52,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:52,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:52,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:52,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:52,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:52,975 INFO L87 Difference]: Start difference. First operand 145 states and 220 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:53,196 INFO L93 Difference]: Finished difference Result 297 states and 472 transitions. [2022-02-20 18:31:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 18:31:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2022-02-20 18:31:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2022-02-20 18:31:53,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 472 transitions. [2022-02-20 18:31:53,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:53,481 INFO L225 Difference]: With dead ends: 297 [2022-02-20 18:31:53,481 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 18:31:53,482 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:31:53,483 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 115 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:53,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 374 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 18:31:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-02-20 18:31:53,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:53,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:31:53,495 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:31:53,496 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:31:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:53,500 INFO L93 Difference]: Finished difference Result 212 states and 324 transitions. [2022-02-20 18:31:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions. [2022-02-20 18:31:53,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:53,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:53,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 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 212 states. [2022-02-20 18:31:53,502 INFO L87 Difference]: Start difference. First operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 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 212 states. [2022-02-20 18:31:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:53,506 INFO L93 Difference]: Finished difference Result 212 states and 324 transitions. [2022-02-20 18:31:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions. [2022-02-20 18:31:53,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:53,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:53,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:53,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have 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:31:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-02-20 18:31:53,512 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 66 [2022-02-20 18:31:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:53,512 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-02-20 18:31:53,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:31:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-02-20 18:31:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-20 18:31:53,514 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:53,514 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] [2022-02-20 18:31:53,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:31:53,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times [2022-02-20 18:31:53,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:53,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475296737] [2022-02-20 18:31:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:53,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {2537#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {2537#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {2537#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {2537#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {2537#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {2537#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {2537#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {2537#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {2537#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#true} assume ~id1~0 != ~id2~0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#true} assume ~id1~0 != ~id3~0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {2537#true} assume ~id2~0 != ~id3~0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {2537#true} assume ~id1~0 >= 0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {2537#true} assume ~id2~0 >= 0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {2537#true} assume ~id3~0 >= 0; {2537#true} is VALID [2022-02-20 18:31:53,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {2537#true} assume 0 == ~r1~0 % 256; {2537#true} is VALID [2022-02-20 18:31:53,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#true} assume 0 == ~r2~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r122~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r132~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r212~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r232~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r312~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,610 INFO L290 TraceCheckUtils]: 28: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != init_~r322~0#1 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax1~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax2~0 % 256; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} init_#res#1 := init_~tmp___5~0#1; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {2539#(<= ~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; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,615 INFO L290 TraceCheckUtils]: 48: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode1~0 % 256); {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 1; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep12~0 % 256); {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~ep13~0 % 256); {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,617 INFO L290 TraceCheckUtils]: 53: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,617 INFO L290 TraceCheckUtils]: 54: Hoare triple {2539#(<= ~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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 != ~mode2~0 % 256); {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {2539#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {2538#false} ~mode2~0 := 1; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {2538#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 59: Hoare triple {2538#false} assume !(0 != ~mode3~0 % 256); {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 60: Hoare triple {2538#false} assume !(~r3~0 % 256 < 2); {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {2538#false} ~mode3~0 := 1; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {2538#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; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {2538#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 64: Hoare triple {2538#false} check_#res#1 := check_~tmp~1#1; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {2538#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {2538#false} assume 0 == assert_~arg#1 % 256; {2538#false} is VALID [2022-02-20 18:31:53,618 INFO L290 TraceCheckUtils]: 67: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-02-20 18:31:53,619 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:31:53,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:53,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475296737] [2022-02-20 18:31:53,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475296737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:53,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:53,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:53,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080957131] [2022-02-20 18:31:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:53,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:53,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:53,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:53,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:53,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:53,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:53,666 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:53,886 INFO L93 Difference]: Finished difference Result 491 states and 782 transitions. [2022-02-20 18:31:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2022-02-20 18:31:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:53,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:31:54,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:54,195 INFO L225 Difference]: With dead ends: 491 [2022-02-20 18:31:54,196 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 18:31:54,196 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:31:54,197 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 117 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 401 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:31:54,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 401 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 18:31:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2022-02-20 18:31:54,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:54,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:31:54,225 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:31:54,226 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:31:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,238 INFO L93 Difference]: Finished difference Result 342 states and 534 transitions. [2022-02-20 18:31:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 534 transitions. [2022-02-20 18:31:54,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:54,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:54,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:31:54,241 INFO L87 Difference]: Start difference. First operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 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 342 states. [2022-02-20 18:31:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,252 INFO L93 Difference]: Finished difference Result 342 states and 534 transitions. [2022-02-20 18:31:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 534 transitions. [2022-02-20 18:31:54,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:54,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:54,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:54,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 1.57566765578635) internal successors, (531), 337 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have 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:31:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 531 transitions. [2022-02-20 18:31:54,260 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 531 transitions. Word has length 68 [2022-02-20 18:31:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:54,261 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 531 transitions. [2022-02-20 18:31:54,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:31:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 531 transitions. [2022-02-20 18:31:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 18:31:54,263 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:54,263 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:31:54,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:31:54,264 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times [2022-02-20 18:31:54,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:54,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237425898] [2022-02-20 18:31:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:54,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {4137#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {4137#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {4137#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {4137#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 4: Hoare triple {4137#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {4137#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {4137#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {4137#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {4137#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {4137#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {4137#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {4137#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {4137#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {4137#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {4137#true} assume ~id1~0 != ~id2~0; {4137#true} is VALID [2022-02-20 18:31:54,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {4137#true} assume ~id1~0 != ~id3~0; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {4137#true} assume ~id2~0 != ~id3~0; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {4137#true} assume ~id1~0 >= 0; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {4137#true} assume ~id2~0 >= 0; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {4137#true} assume ~id3~0 >= 0; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {4137#true} assume 0 == ~r1~0 % 256; {4137#true} is VALID [2022-02-20 18:31:54,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {4137#true} assume 0 == ~r2~0 % 256; {4137#true} is VALID [2022-02-20 18:31:54,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {4137#true} assume 0 == ~r3~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r122~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r132~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r212~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r232~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r312~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != init_~r322~0#1 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax1~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax2~0 % 256; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} init_#res#1 := init_~tmp___5~0#1; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == assume_abort_if_not_~cond#1); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {4139#(<= ~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; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode1~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 1; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep12~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep13~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {4139#(<= ~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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,377 INFO L290 TraceCheckUtils]: 55: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode2~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep21~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~ep23~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {4139#(<= ~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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 != ~mode3~0 % 256); {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:31:54,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {4139#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {4138#false} is VALID [2022-02-20 18:31:54,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {4138#false} ~mode3~0 := 1; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 64: Hoare triple {4138#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; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 65: Hoare triple {4138#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {4138#false} check_#res#1 := check_~tmp~1#1; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {4138#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {4138#false} assume 0 == assert_~arg#1 % 256; {4138#false} is VALID [2022-02-20 18:31:54,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {4138#false} assume !false; {4138#false} is VALID [2022-02-20 18:31:54,380 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:31:54,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:54,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237425898] [2022-02-20 18:31:54,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237425898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:54,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:54,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:31:54,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193062800] [2022-02-20 18:31:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:54,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:54,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,422 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:31:54,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:31:54,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:31:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:31:54,423 INFO L87 Difference]: Start difference. First operand 338 states and 531 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:54,682 INFO L93 Difference]: Finished difference Result 862 states and 1381 transitions. [2022-02-20 18:31:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:31:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2022-02-20 18:31:54,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 490 transitions. [2022-02-20 18:31:54,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:54,972 INFO L225 Difference]: With dead ends: 862 [2022-02-20 18:31:54,972 INFO L226 Difference]: Without dead ends: 584 [2022-02-20 18:31:54,973 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:31:54,973 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 111 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 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:31:54,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:31:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-02-20 18:31:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 578. [2022-02-20 18:31:55,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:55,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 584 states. Second operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have 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:31:55,053 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have 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:31:55,054 INFO L87 Difference]: Start difference. First operand 584 states. Second operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have 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:31:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:55,066 INFO L93 Difference]: Finished difference Result 584 states and 920 transitions. [2022-02-20 18:31:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 920 transitions. [2022-02-20 18:31:55,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:55,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:55,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 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 584 states. [2022-02-20 18:31:55,069 INFO L87 Difference]: Start difference. First operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 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 584 states. [2022-02-20 18:31:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:55,081 INFO L93 Difference]: Finished difference Result 584 states and 920 transitions. [2022-02-20 18:31:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 920 transitions. [2022-02-20 18:31:55,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:55,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:55,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:55,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.58578856152513) internal successors, (915), 577 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have 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:31:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 915 transitions. [2022-02-20 18:31:55,094 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 915 transitions. Word has length 70 [2022-02-20 18:31:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:55,094 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 915 transitions. [2022-02-20 18:31:55,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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:31:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 915 transitions. [2022-02-20 18:31:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 18:31:55,095 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:55,096 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:31:55,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:31:55,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times [2022-02-20 18:31:55,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:55,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574625434] [2022-02-20 18:31:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:55,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {6912#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {6912#true} is VALID [2022-02-20 18:31:55,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {6912#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {6912#true} is VALID [2022-02-20 18:31:55,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {6912#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {6912#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {6912#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {6912#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {6912#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {6912#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {6912#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {6912#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {6912#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {6912#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {6912#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {6912#true} assume ~id1~0 != ~id2~0; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {6912#true} assume ~id1~0 != ~id3~0; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {6912#true} assume ~id2~0 != ~id3~0; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {6912#true} assume ~id1~0 >= 0; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {6912#true} assume ~id2~0 >= 0; {6912#true} is VALID [2022-02-20 18:31:55,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {6912#true} assume ~id3~0 >= 0; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {6912#true} assume 0 == ~r1~0 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {6912#true} assume 0 == ~r2~0 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {6912#true} assume 0 == ~r3~0 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {6912#true} assume 0 != init_~r122~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#true} assume 0 != init_~r132~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {6912#true} assume 0 != init_~r212~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {6912#true} assume 0 != init_~r232~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {6912#true} assume 0 != init_~r312~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {6912#true} assume 0 != init_~r322~0#1 % 256; {6912#true} is VALID [2022-02-20 18:31:55,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {6912#true} assume ~max1~0 == ~id1~0; {6912#true} is VALID [2022-02-20 18:31:55,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {6912#true} assume ~max2~0 == ~id2~0; {6912#true} is VALID [2022-02-20 18:31:55,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {6912#true} assume ~max3~0 == ~id3~0; {6912#true} is VALID [2022-02-20 18:31:55,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {6912#true} assume 0 == ~st1~0; {6914#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:55,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {6914#(<= ~st1~0 0)} assume 0 == ~st2~0; {6915#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {6915#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,180 INFO L290 TraceCheckUtils]: 41: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {6916#(<= (+ ~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; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {6916#(<= (+ ~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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,185 INFO L290 TraceCheckUtils]: 59: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {6916#(<= (+ ~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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,187 INFO L290 TraceCheckUtils]: 66: Hoare triple {6916#(<= (+ ~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; {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:55,188 INFO L290 TraceCheckUtils]: 67: Hoare triple {6916#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {6913#false} is VALID [2022-02-20 18:31:55,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {6913#false} check_#res#1 := check_~tmp~1#1; {6913#false} is VALID [2022-02-20 18:31:55,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {6913#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {6913#false} is VALID [2022-02-20 18:31:55,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {6913#false} assume 0 == assert_~arg#1 % 256; {6913#false} is VALID [2022-02-20 18:31:55,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {6913#false} assume !false; {6913#false} is VALID [2022-02-20 18:31:55,189 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:31:55,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:55,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574625434] [2022-02-20 18:31:55,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574625434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:55,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:55,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:55,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499117004] [2022-02-20 18:31:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:55,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:55,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:55,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:55,229 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:31:55,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:31:55,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:55,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:31:55,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:31:55,231 INFO L87 Difference]: Start difference. First operand 578 states and 915 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:56,583 INFO L93 Difference]: Finished difference Result 2934 states and 4745 transitions. [2022-02-20 18:31:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:31:56,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:31:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2022-02-20 18:31:56,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1072 transitions. [2022-02-20 18:31:57,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:57,409 INFO L225 Difference]: With dead ends: 2934 [2022-02-20 18:31:57,410 INFO L226 Difference]: Without dead ends: 2416 [2022-02-20 18:31:57,410 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:31:57,411 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 936 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:31:57,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1286 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:31:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-02-20 18:31:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1078. [2022-02-20 18:31:57,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:57,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2416 states. Second operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have 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:31:57,603 INFO L74 IsIncluded]: Start isIncluded. First operand 2416 states. Second operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have 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:31:57,605 INFO L87 Difference]: Start difference. First operand 2416 states. Second operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have 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:31:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:57,771 INFO L93 Difference]: Finished difference Result 2416 states and 3878 transitions. [2022-02-20 18:31:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3878 transitions. [2022-02-20 18:31:57,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:57,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:57,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 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 2416 states. [2022-02-20 18:31:57,777 INFO L87 Difference]: Start difference. First operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 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 2416 states. [2022-02-20 18:31:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:57,937 INFO L93 Difference]: Finished difference Result 2416 states and 3878 transitions. [2022-02-20 18:31:57,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3878 transitions. [2022-02-20 18:31:57,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:57,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:57,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:57,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5961002785515321) internal successors, (1719), 1077 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have 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:31:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1719 transitions. [2022-02-20 18:31:57,979 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1719 transitions. Word has length 72 [2022-02-20 18:31:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:57,979 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1719 transitions. [2022-02-20 18:31:57,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 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:31:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1719 transitions. [2022-02-20 18:31:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 18:31:57,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:57,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:31:57,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:31:57,981 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:57,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times [2022-02-20 18:31:57,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:57,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490132578] [2022-02-20 18:31:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:57,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:58,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {16216#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {16216#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {16216#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {16216#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {16216#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {16216#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {16216#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {16216#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {16216#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {16216#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {16216#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {16216#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {16216#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {16216#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {16216#true} assume ~id1~0 != ~id2~0; {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {16216#true} assume ~id1~0 != ~id3~0; {16216#true} is VALID [2022-02-20 18:31:58,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {16216#true} assume ~id2~0 != ~id3~0; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {16216#true} assume ~id1~0 >= 0; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {16216#true} assume ~id2~0 >= 0; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {16216#true} assume ~id3~0 >= 0; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {16216#true} assume 0 == ~r1~0 % 256; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {16216#true} assume 0 == ~r2~0 % 256; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {16216#true} assume 0 == ~r3~0 % 256; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {16216#true} assume 0 != init_~r122~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {16216#true} assume 0 != init_~r132~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {16216#true} assume 0 != init_~r212~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {16216#true} assume 0 != init_~r232~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {16216#true} assume 0 != init_~r312~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {16216#true} assume 0 != init_~r322~0#1 % 256; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {16216#true} assume ~max1~0 == ~id1~0; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {16216#true} assume ~max2~0 == ~id2~0; {16216#true} is VALID [2022-02-20 18:31:58,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {16216#true} assume ~max3~0 == ~id3~0; {16216#true} is VALID [2022-02-20 18:31:58,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {16216#true} assume 0 == ~st1~0; {16218#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:58,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {16218#(<= ~st1~0 0)} assume 0 == ~st2~0; {16218#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:58,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {16218#(<= ~st1~0 0)} assume 0 == ~st3~0; {16218#(<= ~st1~0 0)} is VALID [2022-02-20 18:31:58,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {16218#(<= ~st1~0 0)} assume 0 == ~nl1~0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax1~0 % 256; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax2~0 % 256; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {16219#(<= (+ ~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; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,039 INFO L290 TraceCheckUtils]: 50: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep12~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep13~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,041 INFO L290 TraceCheckUtils]: 57: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep21~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,041 INFO L290 TraceCheckUtils]: 58: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep23~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep31~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 != ~ep32~0 % 256); {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {16219#(<= (+ ~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; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {16219#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:31:58,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {16219#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);check_~tmp~1#1 := 0; {16217#false} is VALID [2022-02-20 18:31:58,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {16217#false} check_#res#1 := check_~tmp~1#1; {16217#false} is VALID [2022-02-20 18:31:58,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {16217#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {16217#false} is VALID [2022-02-20 18:31:58,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {16217#false} assume 0 == assert_~arg#1 % 256; {16217#false} is VALID [2022-02-20 18:31:58,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {16217#false} assume !false; {16217#false} is VALID [2022-02-20 18:31:58,045 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:31:58,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:58,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490132578] [2022-02-20 18:31:58,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490132578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:58,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:58,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:31:58,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851213059] [2022-02-20 18:31:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:58,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:58,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:58,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:31:58,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:58,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:31:58,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:58,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:31:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:31:58,083 INFO L87 Difference]: Start difference. First operand 1078 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:31:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:59,460 INFO L93 Difference]: Finished difference Result 3918 states and 6302 transitions. [2022-02-20 18:31:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:31:59,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-02-20 18:31:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:31:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:31:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:31:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:31:59,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:31:59,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:00,043 INFO L225 Difference]: With dead ends: 3918 [2022-02-20 18:32:00,044 INFO L226 Difference]: Without dead ends: 2900 [2022-02-20 18:32:00,045 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:32:00,045 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 413 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:32:00,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 638 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2022-02-20 18:32:00,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1980. [2022-02-20 18:32:00,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:00,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2900 states. Second operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have 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:32:00,409 INFO L74 IsIncluded]: Start isIncluded. First operand 2900 states. Second operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have 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:32:00,411 INFO L87 Difference]: Start difference. First operand 2900 states. Second operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have 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:32:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:00,614 INFO L93 Difference]: Finished difference Result 2900 states and 4647 transitions. [2022-02-20 18:32:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4647 transitions. [2022-02-20 18:32:00,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:00,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:00,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 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 2900 states. [2022-02-20 18:32:00,622 INFO L87 Difference]: Start difference. First operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 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 2900 states. [2022-02-20 18:32:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:00,820 INFO L93 Difference]: Finished difference Result 2900 states and 4647 transitions. [2022-02-20 18:32:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4647 transitions. [2022-02-20 18:32:00,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:00,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:00,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:00,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1979 states have (on average 1.5972713491662456) internal successors, (3161), 1979 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have 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:32:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 3161 transitions. [2022-02-20 18:32:00,936 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 3161 transitions. Word has length 73 [2022-02-20 18:32:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:00,937 INFO L470 AbstractCegarLoop]: Abstraction has 1980 states and 3161 transitions. [2022-02-20 18:32:00,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:32:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 3161 transitions. [2022-02-20 18:32:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 18:32:00,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:00,938 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:00,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:32:00,938 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times [2022-02-20 18:32:00,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:00,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285154103] [2022-02-20 18:32:00,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:01,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {28582#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {28582#true} is VALID [2022-02-20 18:32:01,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {28582#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {28582#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {28582#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {28582#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {28582#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {28582#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {28582#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {28582#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {28582#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {28582#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {28582#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {28582#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {28582#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {28582#true} assume ~id1~0 != ~id2~0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {28582#true} assume ~id1~0 != ~id3~0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {28582#true} assume ~id2~0 != ~id3~0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {28582#true} assume ~id1~0 >= 0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {28582#true} assume ~id2~0 >= 0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {28582#true} assume ~id3~0 >= 0; {28582#true} is VALID [2022-02-20 18:32:01,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {28582#true} assume 0 == ~r1~0 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {28582#true} assume 0 == ~r2~0 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {28582#true} assume 0 == ~r3~0 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {28582#true} assume 0 != init_~r122~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {28582#true} assume 0 != init_~r132~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {28582#true} assume 0 != init_~r212~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {28582#true} assume 0 != init_~r232~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {28582#true} assume 0 != init_~r312~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {28582#true} assume 0 != init_~r322~0#1 % 256; {28582#true} is VALID [2022-02-20 18:32:01,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {28582#true} assume ~max1~0 == ~id1~0; {28582#true} is VALID [2022-02-20 18:32:01,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {28582#true} assume ~max2~0 == ~id2~0; {28582#true} is VALID [2022-02-20 18:32:01,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {28582#true} assume ~max3~0 == ~id3~0; {28582#true} is VALID [2022-02-20 18:32:01,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {28582#true} assume 0 == ~st1~0; {28582#true} is VALID [2022-02-20 18:32:01,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {28582#true} assume 0 == ~st2~0; {28584#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {28584#(<= ~st2~0 0)} assume 0 == ~st3~0; {28584#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {28584#(<= ~st2~0 0)} assume 0 == ~nl1~0; {28584#(<= ~st2~0 0)} is VALID [2022-02-20 18:32:01,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {28584#(<= ~st2~0 0)} assume 0 == ~nl2~0; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax1~0 % 256; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax2~0 % 256; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,015 INFO L290 TraceCheckUtils]: 45: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {28585#(<= (+ ~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; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,016 INFO L290 TraceCheckUtils]: 48: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode1~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,017 INFO L290 TraceCheckUtils]: 51: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep12~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep13~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode2~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep21~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep23~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,019 INFO L290 TraceCheckUtils]: 60: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~mode3~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep31~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 != ~ep32~0 % 256); {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {28585#(<= (+ ~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; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,022 INFO L290 TraceCheckUtils]: 68: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {28585#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:32:01,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {28585#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);check_~tmp~1#1 := 0; {28583#false} is VALID [2022-02-20 18:32:01,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {28583#false} check_#res#1 := check_~tmp~1#1; {28583#false} is VALID [2022-02-20 18:32:01,023 INFO L290 TraceCheckUtils]: 71: Hoare triple {28583#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {28583#false} is VALID [2022-02-20 18:32:01,023 INFO L290 TraceCheckUtils]: 72: Hoare triple {28583#false} assume 0 == assert_~arg#1 % 256; {28583#false} is VALID [2022-02-20 18:32:01,023 INFO L290 TraceCheckUtils]: 73: Hoare triple {28583#false} assume !false; {28583#false} is VALID [2022-02-20 18:32:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:32:01,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:01,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285154103] [2022-02-20 18:32:01,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285154103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:01,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:01,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:01,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8065601] [2022-02-20 18:32:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:01,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:01,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:32:01,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:01,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:01,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:01,066 INFO L87 Difference]: Start difference. First operand 1980 states and 3161 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:32:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:03,354 INFO L93 Difference]: Finished difference Result 5824 states and 9366 transitions. [2022-02-20 18:32:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-02-20 18:32:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:32:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:32:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:03,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:32:03,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:04,213 INFO L225 Difference]: With dead ends: 5824 [2022-02-20 18:32:04,214 INFO L226 Difference]: Without dead ends: 3904 [2022-02-20 18:32:04,215 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:32:04,216 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 411 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 724 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:32:04,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 724 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2022-02-20 18:32:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 2926. [2022-02-20 18:32:04,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:04,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3904 states. Second operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have 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:32:04,961 INFO L74 IsIncluded]: Start isIncluded. First operand 3904 states. Second operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have 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:32:04,963 INFO L87 Difference]: Start difference. First operand 3904 states. Second operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have 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:32:05,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,350 INFO L93 Difference]: Finished difference Result 3904 states and 6255 transitions. [2022-02-20 18:32:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6255 transitions. [2022-02-20 18:32:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 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 3904 states. [2022-02-20 18:32:05,358 INFO L87 Difference]: Start difference. First operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 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 3904 states. [2022-02-20 18:32:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:05,750 INFO L93 Difference]: Finished difference Result 3904 states and 6255 transitions. [2022-02-20 18:32:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6255 transitions. [2022-02-20 18:32:05,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:05,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:05,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2925 states have (on average 1.594871794871795) internal successors, (4665), 2925 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have 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:32:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4665 transitions. [2022-02-20 18:32:05,988 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4665 transitions. Word has length 74 [2022-02-20 18:32:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:05,989 INFO L470 AbstractCegarLoop]: Abstraction has 2926 states and 4665 transitions. [2022-02-20 18:32:05,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:32:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4665 transitions. [2022-02-20 18:32:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 18:32:05,990 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:05,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:05,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:32:05,991 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times [2022-02-20 18:32:05,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:05,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830637773] [2022-02-20 18:32:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:06,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {46117#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {46117#true} is VALID [2022-02-20 18:32:06,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {46117#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {46117#true} is VALID [2022-02-20 18:32:06,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {46117#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {46117#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {46117#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {46117#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {46117#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {46117#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {46117#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {46117#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {46117#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {46117#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {46117#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {46117#true} is VALID [2022-02-20 18:32:06,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {46117#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {46117#true} is VALID [2022-02-20 18:32:06,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {46117#true} assume ~id1~0 != ~id2~0; {46117#true} is VALID [2022-02-20 18:32:06,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {46117#true} assume ~id1~0 != ~id3~0; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {46117#true} assume ~id2~0 != ~id3~0; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {46117#true} assume ~id1~0 >= 0; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {46117#true} assume ~id2~0 >= 0; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {46117#true} assume ~id3~0 >= 0; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {46117#true} assume 0 == ~r1~0 % 256; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {46117#true} assume 0 == ~r2~0 % 256; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {46117#true} assume 0 == ~r3~0 % 256; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {46117#true} assume 0 != init_~r122~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {46117#true} assume 0 != init_~r132~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {46117#true} assume 0 != init_~r212~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {46117#true} assume 0 != init_~r232~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {46117#true} assume 0 != init_~r312~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {46117#true} assume 0 != init_~r322~0#1 % 256; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {46117#true} assume ~max1~0 == ~id1~0; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {46117#true} assume ~max2~0 == ~id2~0; {46117#true} is VALID [2022-02-20 18:32:06,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {46117#true} assume ~max3~0 == ~id3~0; {46117#true} is VALID [2022-02-20 18:32:06,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {46117#true} assume 0 == ~st1~0; {46117#true} is VALID [2022-02-20 18:32:06,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {46117#true} assume 0 == ~st2~0; {46117#true} is VALID [2022-02-20 18:32:06,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {46117#true} assume 0 == ~st3~0; {46119#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:06,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {46119#(<= ~st3~0 0)} assume 0 == ~nl1~0; {46119#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:06,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {46119#(<= ~st3~0 0)} assume 0 == ~nl2~0; {46119#(<= ~st3~0 0)} is VALID [2022-02-20 18:32:06,050 INFO L290 TraceCheckUtils]: 37: Hoare triple {46119#(<= ~st3~0 0)} assume 0 == ~nl3~0; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax1~0 % 256; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax2~0 % 256; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {46120#(<= (+ ~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; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode1~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep12~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep13~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode2~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep21~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep23~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~mode3~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,057 INFO L290 TraceCheckUtils]: 63: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep31~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,058 INFO L290 TraceCheckUtils]: 64: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 != ~ep32~0 % 256); {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {46120#(<= (+ ~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; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,059 INFO L290 TraceCheckUtils]: 67: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {46120#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:32:06,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {46120#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);check_~tmp~1#1 := 0; {46118#false} is VALID [2022-02-20 18:32:06,060 INFO L290 TraceCheckUtils]: 71: Hoare triple {46118#false} check_#res#1 := check_~tmp~1#1; {46118#false} is VALID [2022-02-20 18:32:06,060 INFO L290 TraceCheckUtils]: 72: Hoare triple {46118#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {46118#false} is VALID [2022-02-20 18:32:06,060 INFO L290 TraceCheckUtils]: 73: Hoare triple {46118#false} assume 0 == assert_~arg#1 % 256; {46118#false} is VALID [2022-02-20 18:32:06,060 INFO L290 TraceCheckUtils]: 74: Hoare triple {46118#false} assume !false; {46118#false} is VALID [2022-02-20 18:32:06,060 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:32:06,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:06,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830637773] [2022-02-20 18:32:06,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830637773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:06,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:06,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:32:06,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192153711] [2022-02-20 18:32:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:06,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:32:06,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:06,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:32:06,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:06,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:32:06,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:32:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:32:06,101 INFO L87 Difference]: Start difference. First operand 2926 states and 4665 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:32:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:10,211 INFO L93 Difference]: Finished difference Result 8576 states and 13754 transitions. [2022-02-20 18:32:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:32:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-20 18:32:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:32:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:32:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2022-02-20 18:32:10,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 646 transitions. [2022-02-20 18:32:10,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:11,534 INFO L225 Difference]: With dead ends: 8576 [2022-02-20 18:32:11,534 INFO L226 Difference]: Without dead ends: 5710 [2022-02-20 18:32:11,536 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:32:11,537 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 409 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 733 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:32:11,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 733 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2022-02-20 18:32:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4296. [2022-02-20 18:32:12,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:12,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5710 states. Second operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states have 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:32:12,925 INFO L74 IsIncluded]: Start isIncluded. First operand 5710 states. Second operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states have 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:32:12,928 INFO L87 Difference]: Start difference. First operand 5710 states. Second operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states have 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:32:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:13,703 INFO L93 Difference]: Finished difference Result 5710 states and 9127 transitions. [2022-02-20 18:32:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 9127 transitions. [2022-02-20 18:32:13,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:13,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:13,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 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 5710 states. [2022-02-20 18:32:13,713 INFO L87 Difference]: Start difference. First operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 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 5710 states. [2022-02-20 18:32:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:14,507 INFO L93 Difference]: Finished difference Result 5710 states and 9127 transitions. [2022-02-20 18:32:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 9127 transitions. [2022-02-20 18:32:14,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:14,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:14,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:14,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 4295 states have (on average 1.5913853317811408) internal successors, (6835), 4295 states have internal predecessors, (6835), 0 states have call successors, (0), 0 states have 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:32:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6835 transitions. [2022-02-20 18:32:15,044 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6835 transitions. Word has length 75 [2022-02-20 18:32:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:15,045 INFO L470 AbstractCegarLoop]: Abstraction has 4296 states and 6835 transitions. [2022-02-20 18:32:15,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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:32:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6835 transitions. [2022-02-20 18:32:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:15,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:15,046 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:15,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:32:15,046 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:15,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times [2022-02-20 18:32:15,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:15,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643759910] [2022-02-20 18:32:15,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:15,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {71830#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {71830#true} is VALID [2022-02-20 18:32:15,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {71830#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {71830#true} is VALID [2022-02-20 18:32:15,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {71830#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {71830#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {71830#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {71830#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {71830#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {71830#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {71830#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {71830#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {71830#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {71830#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {71830#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {71830#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {71830#true} assume ~id1~0 != ~id2~0; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {71830#true} assume ~id1~0 != ~id3~0; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {71830#true} assume ~id2~0 != ~id3~0; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {71830#true} assume ~id1~0 >= 0; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {71830#true} assume ~id2~0 >= 0; {71830#true} is VALID [2022-02-20 18:32:15,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {71830#true} assume ~id3~0 >= 0; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {71830#true} assume 0 == ~r1~0 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {71830#true} assume 0 == ~r2~0 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {71830#true} assume 0 == ~r3~0 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {71830#true} assume 0 != init_~r122~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {71830#true} assume 0 != init_~r132~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {71830#true} assume 0 != init_~r212~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {71830#true} assume 0 != init_~r232~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {71830#true} assume 0 != init_~r312~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {71830#true} assume 0 != init_~r322~0#1 % 256; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {71830#true} assume ~max1~0 == ~id1~0; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {71830#true} assume ~max2~0 == ~id2~0; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {71830#true} assume ~max3~0 == ~id3~0; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {71830#true} assume 0 == ~st1~0; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {71830#true} assume 0 == ~st2~0; {71830#true} is VALID [2022-02-20 18:32:15,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {71830#true} assume 0 == ~st3~0; {71830#true} is VALID [2022-02-20 18:32:15,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {71830#true} assume 0 == ~nl1~0; {71830#true} is VALID [2022-02-20 18:32:15,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {71830#true} assume 0 == ~nl2~0; {71830#true} is VALID [2022-02-20 18:32:15,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {71830#true} assume 0 == ~nl3~0; {71830#true} is VALID [2022-02-20 18:32:15,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {71830#true} assume 0 == ~mode1~0 % 256; {71830#true} is VALID [2022-02-20 18:32:15,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {71830#true} assume 0 == ~mode2~0 % 256; {71830#true} is VALID [2022-02-20 18:32:15,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {71830#true} assume 0 == ~mode3~0 % 256; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax1~0 % 256; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax2~0 % 256; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp___5~0#1; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {71832#(= (+ (* (- 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; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r1~0 % 256 < 1; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep12~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep13~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode1~0 := 1; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {71832#(= (+ (* (- 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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~r2~0 % 256 < 2; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep21~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~ep23~0 % 256); {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~mode2~0 := 1; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {71832#(= (+ (* (- 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, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {71832#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256; {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 62: Hoare triple {71831#false} assume !(255 == ~r3~0 % 256); {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 63: Hoare triple {71831#false} ~r3~0 := 1 + ~r3~0 % 256; {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 64: Hoare triple {71831#false} assume !(0 != ~ep13~0 % 256); {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 65: Hoare triple {71831#false} assume !(0 != ~ep23~0 % 256); {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {71831#false} ~newmax3~0 := node3_~newmax~2#1; {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {71831#false} assume 2 == ~r3~0 % 256; {71831#false} is VALID [2022-02-20 18:32:15,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {71831#false} assume ~max3~0 == ~id3~0;~st3~0 := 1; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 69: Hoare triple {71831#false} ~mode3~0 := 0; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {71831#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; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {71831#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 72: Hoare triple {71831#false} check_#res#1 := check_~tmp~1#1; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 73: Hoare triple {71831#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {71831#false} assume 0 == assert_~arg#1 % 256; {71831#false} is VALID [2022-02-20 18:32:15,106 INFO L290 TraceCheckUtils]: 75: Hoare triple {71831#false} assume !false; {71831#false} is VALID [2022-02-20 18:32:15,106 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:32:15,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:15,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643759910] [2022-02-20 18:32:15,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643759910] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:15,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:15,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:15,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082244830] [2022-02-20 18:32:15,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:15,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:15,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:15,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:15,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:15,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:15,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:15,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:15,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:15,156 INFO L87 Difference]: Start difference. First operand 4296 states and 6835 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:20,197 INFO L93 Difference]: Finished difference Result 9648 states and 15352 transitions. [2022-02-20 18:32:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:20,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:20,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:20,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:21,845 INFO L225 Difference]: With dead ends: 9648 [2022-02-20 18:32:21,845 INFO L226 Difference]: Without dead ends: 6608 [2022-02-20 18:32:21,848 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:32:21,848 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 110 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 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:32:21,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 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:32:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2022-02-20 18:32:24,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 6606. [2022-02-20 18:32:24,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:24,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6608 states. Second operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have 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:32:24,100 INFO L74 IsIncluded]: Start isIncluded. First operand 6608 states. Second operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have 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:32:24,105 INFO L87 Difference]: Start difference. First operand 6608 states. Second operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have 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:32:25,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:25,240 INFO L93 Difference]: Finished difference Result 6608 states and 10413 transitions. [2022-02-20 18:32:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 10413 transitions. [2022-02-20 18:32:25,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:25,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:25,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 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 6608 states. [2022-02-20 18:32:25,256 INFO L87 Difference]: Start difference. First operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 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 6608 states. [2022-02-20 18:32:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:26,476 INFO L93 Difference]: Finished difference Result 6608 states and 10413 transitions. [2022-02-20 18:32:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 10413 transitions. [2022-02-20 18:32:26,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:26,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:26,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:26,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 6605 states have (on average 1.5763815291445875) internal successors, (10412), 6605 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have 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:32:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 10412 transitions. [2022-02-20 18:32:27,782 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 10412 transitions. Word has length 76 [2022-02-20 18:32:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:27,783 INFO L470 AbstractCegarLoop]: Abstraction has 6606 states and 10412 transitions. [2022-02-20 18:32:27,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 10412 transitions. [2022-02-20 18:32:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:27,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:27,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:27,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:32:27,784 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times [2022-02-20 18:32:27,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:27,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465706527] [2022-02-20 18:32:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:27,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {103251#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {103251#true} is VALID [2022-02-20 18:32:27,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {103251#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {103251#true} is VALID [2022-02-20 18:32:27,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {103251#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {103251#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {103251#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {103251#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {103251#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {103251#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {103251#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {103251#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {103251#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {103251#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {103251#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {103251#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {103251#true} assume ~id1~0 != ~id2~0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {103251#true} assume ~id1~0 != ~id3~0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {103251#true} assume ~id2~0 != ~id3~0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {103251#true} assume ~id1~0 >= 0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {103251#true} assume ~id2~0 >= 0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {103251#true} assume ~id3~0 >= 0; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {103251#true} assume 0 == ~r1~0 % 256; {103251#true} is VALID [2022-02-20 18:32:27,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {103251#true} assume 0 == ~r2~0 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {103251#true} assume 0 == ~r3~0 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {103251#true} assume 0 != init_~r122~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {103251#true} assume 0 != init_~r132~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {103251#true} assume 0 != init_~r212~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {103251#true} assume 0 != init_~r232~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {103251#true} assume 0 != init_~r312~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {103251#true} assume 0 != init_~r322~0#1 % 256; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {103251#true} assume ~max1~0 == ~id1~0; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {103251#true} assume ~max2~0 == ~id2~0; {103251#true} is VALID [2022-02-20 18:32:27,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {103251#true} assume ~max3~0 == ~id3~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {103251#true} assume 0 == ~st1~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {103251#true} assume 0 == ~st2~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {103251#true} assume 0 == ~st3~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {103251#true} assume 0 == ~nl1~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {103251#true} assume 0 == ~nl2~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {103251#true} assume 0 == ~nl3~0; {103251#true} is VALID [2022-02-20 18:32:27,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {103251#true} assume 0 == ~mode1~0 % 256; {103251#true} is VALID [2022-02-20 18:32:27,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {103251#true} assume 0 == ~mode2~0 % 256; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax1~0 % 256; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax2~0 % 256; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp___5~0#1; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {103253#(= (+ (* (- 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; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,830 INFO L290 TraceCheckUtils]: 50: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~r1~0 % 256 < 1; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep12~0 % 256); {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,831 INFO L290 TraceCheckUtils]: 52: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~ep13~0 % 256); {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,831 INFO L290 TraceCheckUtils]: 53: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~mode1~0 := 1; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {103253#(= (+ (* (- 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, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {103253#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256; {103252#false} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {103252#false} assume !(255 == ~r2~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 57: Hoare triple {103252#false} ~r2~0 := 1 + ~r2~0 % 256; {103252#false} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {103252#false} assume !(0 != ~ep12~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {103252#false} assume !(0 != ~ep32~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,832 INFO L290 TraceCheckUtils]: 60: Hoare triple {103252#false} ~newmax2~0 := node2_~newmax~1#1; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {103252#false} assume 2 == ~r2~0 % 256; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {103252#false} assume ~max2~0 == ~id2~0;~st2~0 := 1; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 63: Hoare triple {103252#false} ~mode2~0 := 0; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {103252#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 65: Hoare triple {103252#false} assume !(0 != ~mode3~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 66: Hoare triple {103252#false} assume ~r3~0 % 256 < 2; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 67: Hoare triple {103252#false} assume !(0 != ~ep31~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 68: Hoare triple {103252#false} assume !(0 != ~ep32~0 % 256); {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 69: Hoare triple {103252#false} ~mode3~0 := 1; {103252#false} is VALID [2022-02-20 18:32:27,833 INFO L290 TraceCheckUtils]: 70: Hoare triple {103252#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; {103252#false} is VALID [2022-02-20 18:32:27,834 INFO L290 TraceCheckUtils]: 71: Hoare triple {103252#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {103252#false} is VALID [2022-02-20 18:32:27,834 INFO L290 TraceCheckUtils]: 72: Hoare triple {103252#false} check_#res#1 := check_~tmp~1#1; {103252#false} is VALID [2022-02-20 18:32:27,834 INFO L290 TraceCheckUtils]: 73: Hoare triple {103252#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {103252#false} is VALID [2022-02-20 18:32:27,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {103252#false} assume 0 == assert_~arg#1 % 256; {103252#false} is VALID [2022-02-20 18:32:27,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {103252#false} assume !false; {103252#false} is VALID [2022-02-20 18:32:27,834 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:32:27,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:27,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465706527] [2022-02-20 18:32:27,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465706527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:27,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:27,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:27,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679350064] [2022-02-20 18:32:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:27,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:27,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:27,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:27,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:27,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:27,880 INFO L87 Difference]: Start difference. First operand 6606 states and 10412 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:37,640 INFO L93 Difference]: Finished difference Result 14324 states and 22602 transitions. [2022-02-20 18:32:37,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:32:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:32:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:37,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2022-02-20 18:32:37,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 470 transitions. [2022-02-20 18:32:37,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 470 edges. 470 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:40,774 INFO L225 Difference]: With dead ends: 14324 [2022-02-20 18:32:40,774 INFO L226 Difference]: Without dead ends: 9676 [2022-02-20 18:32:40,777 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:32:40,777 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 116 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 477 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:32:40,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 477 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:32:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9676 states. [2022-02-20 18:32:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9676 to 9674. [2022-02-20 18:32:44,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:32:44,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9676 states. Second operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 0 states have 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:32:44,361 INFO L74 IsIncluded]: Start isIncluded. First operand 9676 states. Second operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 0 states have 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:32:44,368 INFO L87 Difference]: Start difference. First operand 9676 states. Second operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 0 states have 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:32:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:46,848 INFO L93 Difference]: Finished difference Result 9676 states and 15115 transitions. [2022-02-20 18:32:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9676 states and 15115 transitions. [2022-02-20 18:32:46,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:46,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:46,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 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 9676 states. [2022-02-20 18:32:46,874 INFO L87 Difference]: Start difference. First operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 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 9676 states. [2022-02-20 18:32:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:32:49,187 INFO L93 Difference]: Finished difference Result 9676 states and 15115 transitions. [2022-02-20 18:32:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9676 states and 15115 transitions. [2022-02-20 18:32:49,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:32:49,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:32:49,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:32:49,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:32:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9674 states, 9673 states have (on average 1.5624935387160137) internal successors, (15114), 9673 states have internal predecessors, (15114), 0 states have call successors, (0), 0 states have 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:32:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 15114 transitions. [2022-02-20 18:32:51,807 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 15114 transitions. Word has length 76 [2022-02-20 18:32:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:32:51,807 INFO L470 AbstractCegarLoop]: Abstraction has 9674 states and 15114 transitions. [2022-02-20 18:32:51,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 15114 transitions. [2022-02-20 18:32:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:32:51,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:32:51,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:32:51,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:32:51,808 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:32:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:32:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 700947013, now seen corresponding path program 1 times [2022-02-20 18:32:51,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:32:51,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627241902] [2022-02-20 18:32:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:32:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:32:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:32:51,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {149843#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(43, 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;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {149843#true} is VALID [2022-02-20 18:32:51,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {149843#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~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#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;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;assume -128 <= main_#t~nondet34#1 && main_#t~nondet34#1 <= 127;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume -128 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 127;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;assume -128 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 127;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;assume -128 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 127;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#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; {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {149843#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {149843#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {149843#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {149843#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {149843#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {149843#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {149843#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {149843#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {149843#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {149843#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {149843#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {149843#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {149843#true} assume ~id1~0 != ~id2~0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {149843#true} assume ~id1~0 != ~id3~0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {149843#true} assume ~id2~0 != ~id3~0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {149843#true} assume ~id1~0 >= 0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {149843#true} assume ~id2~0 >= 0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {149843#true} assume ~id3~0 >= 0; {149843#true} is VALID [2022-02-20 18:32:51,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {149843#true} assume 0 == ~r1~0 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {149843#true} assume 0 == ~r2~0 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {149843#true} assume 0 == ~r3~0 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {149843#true} assume 0 != init_~r122~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {149843#true} assume 0 != init_~r132~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {149843#true} assume 0 != init_~r212~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {149843#true} assume 0 != init_~r232~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {149843#true} assume 0 != init_~r312~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {149843#true} assume 0 != init_~r322~0#1 % 256; {149843#true} is VALID [2022-02-20 18:32:51,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {149843#true} assume ~max1~0 == ~id1~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {149843#true} assume ~max2~0 == ~id2~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {149843#true} assume ~max3~0 == ~id3~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {149843#true} assume 0 == ~st1~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {149843#true} assume 0 == ~st2~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {149843#true} assume 0 == ~st3~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {149843#true} assume 0 == ~nl1~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {149843#true} assume 0 == ~nl2~0; {149843#true} is VALID [2022-02-20 18:32:51,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {149843#true} assume 0 == ~nl3~0; {149843#true} is VALID [2022-02-20 18:32:51,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {149843#true} assume 0 == ~mode1~0 % 256; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax1~0 % 256; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax2~0 % 256; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp___5~0#1; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret40#1 && main_#t~ret40#1 <= 2147483647;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {149845#(= (+ (* (- 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; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:32:51,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {149845#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {149844#false} assume !(255 == ~r1~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {149844#false} ~r1~0 := 1 + ~r1~0 % 256; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {149844#false} assume !(0 != ~ep21~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {149844#false} assume !(0 != ~ep31~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {149844#false} ~newmax1~0 := node1_~newmax~0#1; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {149844#false} assume 2 == ~r1~0 % 256; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {149844#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {149844#false} ~mode1~0 := 0; {149844#false} is VALID [2022-02-20 18:32:51,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {149844#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 59: Hoare triple {149844#false} assume !(0 != ~mode2~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {149844#false} assume ~r2~0 % 256 < 2; {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {149844#false} assume !(0 != ~ep21~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {149844#false} assume !(0 != ~ep23~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {149844#false} ~mode2~0 := 1; {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {149844#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {149844#false} assume !(0 != ~mode3~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {149844#false} assume ~r3~0 % 256 < 2; {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {149844#false} assume !(0 != ~ep31~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {149844#false} assume !(0 != ~ep32~0 % 256); {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 69: Hoare triple {149844#false} ~mode3~0 := 1; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {149844#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; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {149844#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {149844#false} check_#res#1 := check_~tmp~1#1; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {149844#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret41#1 && main_#t~ret41#1 <= 2147483647;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {149844#false} assume 0 == assert_~arg#1 % 256; {149844#false} is VALID [2022-02-20 18:32:51,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {149844#false} assume !false; {149844#false} is VALID [2022-02-20 18:32:51,863 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:32:51,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:32:51,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627241902] [2022-02-20 18:32:51,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627241902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:32:51,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:32:51,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:32:51,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179944240] [2022-02-20 18:32:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:32:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-02-20 18:32:51,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:32:51,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:32:51,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:32:51,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:32:51,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:32:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:32:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:32:51,903 INFO L87 Difference]: Start difference. First operand 9674 states and 15114 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)