./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:57:16,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:57:16,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:57:16,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:57:16,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:57:16,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:57:16,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:57:16,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:57:16,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:57:16,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:57:16,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:57:16,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:57:16,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:57:16,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:57:16,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:57:16,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:57:16,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:57:17,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:57:17,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:57:17,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:57:17,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:57:17,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:57:17,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:57:17,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:57:17,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:57:17,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:57:17,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:57:17,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:57:17,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:57:17,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:57:17,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:57:17,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:57:17,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:57:17,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:57:17,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:57:17,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:57:17,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:57:17,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:57:17,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:57:17,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:57:17,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:57:17,032 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:57:17,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:57:17,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:57:17,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:57:17,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:57:17,064 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:57:17,064 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:57:17,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:57:17,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:57:17,065 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:57:17,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:57:17,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:57:17,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:57:17,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:57:17,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:57:17,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:57:17,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:57:17,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:57:17,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:57:17,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:57:17,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:57:17,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:57:17,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:57:17,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:57:17,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:57:17,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:17,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:57:17,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:57:17,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:57:17,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:57:17,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:57:17,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:57:17,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:57:17,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:57:17,071 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 -> 3af6b76c8112c46f4f3f430659495baba58dab9f6300080b3889ede952fb5526 [2022-02-20 18:57:17,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:57:17,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:57:17,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:57:17,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:57:17,325 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:57:17,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:17,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e1a8605/f01899465b1e466997fccabf723cf117/FLAGb3d811b32 [2022-02-20 18:57:17,765 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:57:17,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:17,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e1a8605/f01899465b1e466997fccabf723cf117/FLAGb3d811b32 [2022-02-20 18:57:17,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e1a8605/f01899465b1e466997fccabf723cf117 [2022-02-20 18:57:17,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:57:17,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:57:17,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:17,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:57:17,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:57:17,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:17" (1/1) ... [2022-02-20 18:57:17,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69938f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:17, skipping insertion in model container [2022-02-20 18:57:17,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:57:17" (1/1) ... [2022-02-20 18:57:17,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:57:17,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:57:18,059 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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2022-02-20 18:57:18,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:18,126 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:57:18,189 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-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7752,7765] [2022-02-20 18:57:18,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:57:18,224 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:57:18,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18 WrapperNode [2022-02-20 18:57:18,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:57:18,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:18,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:57:18,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:57:18,235 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:57:18" (1/1) ... [2022-02-20 18:57:18,244 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:57:18" (1/1) ... [2022-02-20 18:57:18,306 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 617 [2022-02-20 18:57:18,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:57:18,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:57:18,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:57:18,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:57:18,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:57:18,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:57:18,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:57:18,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:57:18,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (1/1) ... [2022-02-20 18:57:18,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:57:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:57:18,383 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:57:18,385 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:57:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:57:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:57:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:57:18,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:57:18,510 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:57:18,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:57:19,145 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:57:19,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:57:19,155 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:57:19,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:19 BoogieIcfgContainer [2022-02-20 18:57:19,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:57:19,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:57:19,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:57:19,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:57:19,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:57:17" (1/3) ... [2022-02-20 18:57:19,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14571ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:19, skipping insertion in model container [2022-02-20 18:57:19,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:57:18" (2/3) ... [2022-02-20 18:57:19,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14571ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:57:19, skipping insertion in model container [2022-02-20 18:57:19,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:57:19" (3/3) ... [2022-02-20 18:57:19,165 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-02-20 18:57:19,169 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:57:19,169 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:57:19,228 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:57:19,234 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:57:19,235 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:57:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 147 states have (on average 1.7346938775510203) internal successors, (255), 148 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-20 18:57:19,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:19,262 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] [2022-02-20 18:57:19,262 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash -970283638, now seen corresponding path program 1 times [2022-02-20 18:57:19,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:19,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699908593] [2022-02-20 18:57:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:19,665 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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {152#true} is VALID [2022-02-20 18:57:19,665 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~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {152#true} is VALID [2022-02-20 18:57:19,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {152#true} is VALID [2022-02-20 18:57:19,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {152#true} is VALID [2022-02-20 18:57:19,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {152#true} assume ~id1~0 != ~id2~0; {152#true} is VALID [2022-02-20 18:57:19,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#true} assume ~id1~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:57:19,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {152#true} assume ~id2~0 != ~id3~0; {152#true} is VALID [2022-02-20 18:57:19,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#true} assume ~id1~0 >= 0; {152#true} is VALID [2022-02-20 18:57:19,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {152#true} assume ~id2~0 >= 0; {152#true} is VALID [2022-02-20 18:57:19,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {152#true} assume ~id3~0 >= 0; {152#true} is VALID [2022-02-20 18:57:19,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {152#true} assume 0 == ~r1~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r2~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~r3~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max1~0 == ~id1~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max2~0 == ~id2~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume ~max3~0 == ~id3~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st1~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st2~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~st3~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl1~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl2~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~nl3~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode1~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode2~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 == ~mode3~0 % 256; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax1~0 % 256); {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax2~0 % 256); {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !!(0 == ~mode1~0 % 256); {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} is VALID [2022-02-20 18:57:19,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {154#(<= ~r1~0 (* (div ~r1~0 256) 256))} assume !(~r1~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:57:19,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {153#false} ~mode1~0 := 1; {153#false} is VALID [2022-02-20 18:57:19,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {153#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:19,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {153#false} assume !!(0 == ~mode2~0 % 256); {153#false} is VALID [2022-02-20 18:57:19,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {153#false} assume !(~r2~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:57:19,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {153#false} ~mode2~0 := 1; {153#false} is VALID [2022-02-20 18:57:19,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {153#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:19,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {153#false} assume !!(0 == ~mode3~0 % 256); {153#false} is VALID [2022-02-20 18:57:19,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {153#false} assume !(~r3~0 % 256 < 2); {153#false} is VALID [2022-02-20 18:57:19,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {153#false} ~mode3~0 := 1; {153#false} is VALID [2022-02-20 18:57:19,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {153#false} ~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;havoc main_~check__tmp~0#1; {153#false} is VALID [2022-02-20 18:57:19,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {153#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {153#false} is VALID [2022-02-20 18:57:19,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {153#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 18:57:19,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {153#false} assume 0 == main_~assert__arg~0#1 % 256; {153#false} is VALID [2022-02-20 18:57:19,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 18:57:19,700 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:57:19,701 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:19,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699908593] [2022-02-20 18:57:19,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699908593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:19,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:19,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:19,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799623532] [2022-02-20 18:57:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:57:19,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:19,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:19,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:19,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:19,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:19,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:19,809 INFO L87 Difference]: Start difference. First operand has 149 states, 147 states have (on average 1.7346938775510203) internal successors, (255), 148 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:20,268 INFO L93 Difference]: Finished difference Result 335 states and 559 transitions. [2022-02-20 18:57:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:20,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-02-20 18:57:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2022-02-20 18:57:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2022-02-20 18:57:20,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 559 transitions. [2022-02-20 18:57:20,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:20,809 INFO L225 Difference]: With dead ends: 335 [2022-02-20 18:57:20,809 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 18:57:20,812 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:57:20,815 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 151 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:20,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 448 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 18:57:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-02-20 18:57:20,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:20,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,875 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,876 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:20,885 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2022-02-20 18:57:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 361 transitions. [2022-02-20 18:57:20,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:20,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:20,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:57:20,889 INFO L87 Difference]: Start difference. First operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 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 231 states. [2022-02-20 18:57:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:20,898 INFO L93 Difference]: Finished difference Result 231 states and 361 transitions. [2022-02-20 18:57:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 361 transitions. [2022-02-20 18:57:20,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:20,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:20,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:20,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 227 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 359 transitions. [2022-02-20 18:57:20,911 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 359 transitions. Word has length 56 [2022-02-20 18:57:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:20,912 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 359 transitions. [2022-02-20 18:57:20,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 359 transitions. [2022-02-20 18:57:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 18:57:20,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:20,914 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] [2022-02-20 18:57:20,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:57:20,914 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1615417163, now seen corresponding path program 1 times [2022-02-20 18:57:20,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:20,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490144799] [2022-02-20 18:57:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:21,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {1380#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {1380#true} is VALID [2022-02-20 18:57:21,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {1380#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1380#true} is VALID [2022-02-20 18:57:21,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {1380#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {1380#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {1380#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {1380#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {1380#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {1380#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1380#true} is VALID [2022-02-20 18:57:21,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1380#true} is VALID [2022-02-20 18:57:21,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#true} assume ~id1~0 != ~id2~0; {1380#true} is VALID [2022-02-20 18:57:21,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {1380#true} assume ~id1~0 != ~id3~0; {1380#true} is VALID [2022-02-20 18:57:21,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {1380#true} assume ~id2~0 != ~id3~0; {1380#true} is VALID [2022-02-20 18:57:21,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {1380#true} assume ~id1~0 >= 0; {1380#true} is VALID [2022-02-20 18:57:21,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {1380#true} assume ~id2~0 >= 0; {1380#true} is VALID [2022-02-20 18:57:21,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {1380#true} assume ~id3~0 >= 0; {1380#true} is VALID [2022-02-20 18:57:21,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {1380#true} assume 0 == ~r1~0 % 256; {1380#true} is VALID [2022-02-20 18:57:21,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#true} assume 0 == ~r2~0 % 256; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~r3~0 % 256; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max1~0 == ~id1~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max2~0 == ~id2~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~max3~0 == ~id3~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st1~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st2~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~st3~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl1~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl2~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~nl3~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode1~0 % 256; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode2~0 % 256; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 == ~mode3~0 % 256; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax1~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,020 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax2~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode1~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume ~r1~0 % 256 < 2; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep12~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~ep13~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} ~mode1~0 := 1; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !!(0 == ~mode2~0 % 256); {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} is VALID [2022-02-20 18:57:21,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {1382#(<= ~r2~0 (* 256 (div ~r2~0 256)))} assume !(~r2~0 % 256 < 2); {1381#false} is VALID [2022-02-20 18:57:21,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {1381#false} ~mode2~0 := 1; {1381#false} is VALID [2022-02-20 18:57:21,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {1381#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {1381#false} is VALID [2022-02-20 18:57:21,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {1381#false} assume !!(0 == ~mode3~0 % 256); {1381#false} is VALID [2022-02-20 18:57:21,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {1381#false} assume !(~r3~0 % 256 < 2); {1381#false} is VALID [2022-02-20 18:57:21,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {1381#false} ~mode3~0 := 1; {1381#false} is VALID [2022-02-20 18:57:21,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {1381#false} ~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;havoc main_~check__tmp~0#1; {1381#false} is VALID [2022-02-20 18:57:21,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {1381#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {1381#false} is VALID [2022-02-20 18:57:21,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {1381#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1381#false} is VALID [2022-02-20 18:57:21,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {1381#false} assume 0 == main_~assert__arg~0#1 % 256; {1381#false} is VALID [2022-02-20 18:57:21,027 INFO L290 TraceCheckUtils]: 57: Hoare triple {1381#false} assume !false; {1381#false} is VALID [2022-02-20 18:57:21,028 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:57:21,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:21,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490144799] [2022-02-20 18:57:21,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490144799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:21,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:21,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:21,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278592443] [2022-02-20 18:57:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:57:21,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:21,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:21,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:21,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:21,077 INFO L87 Difference]: Start difference. First operand 228 states and 359 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:21,522 INFO L93 Difference]: Finished difference Result 566 states and 911 transitions. [2022-02-20 18:57:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:21,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-02-20 18:57:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-02-20 18:57:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-02-20 18:57:21,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 529 transitions. [2022-02-20 18:57:21,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:21,948 INFO L225 Difference]: With dead ends: 566 [2022-02-20 18:57:21,948 INFO L226 Difference]: Without dead ends: 389 [2022-02-20 18:57:21,949 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:57:21,950 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 424 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:57:21,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 424 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-02-20 18:57:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2022-02-20 18:57:22,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:22,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,045 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,046 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:22,062 INFO L93 Difference]: Finished difference Result 389 states and 617 transitions. [2022-02-20 18:57:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 617 transitions. [2022-02-20 18:57:22,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:22,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:22,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 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 389 states. [2022-02-20 18:57:22,065 INFO L87 Difference]: Start difference. First operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 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 389 states. [2022-02-20 18:57:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:22,080 INFO L93 Difference]: Finished difference Result 389 states and 617 transitions. [2022-02-20 18:57:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 617 transitions. [2022-02-20 18:57:22,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:22,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:22,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:22,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2022-02-20 18:57:22,106 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 58 [2022-02-20 18:57:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:22,106 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2022-02-20 18:57:22,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2022-02-20 18:57:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-20 18:57:22,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:22,108 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] [2022-02-20 18:57:22,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:57:22,109 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1881805132, now seen corresponding path program 1 times [2022-02-20 18:57:22,110 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:22,110 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495483661] [2022-02-20 18:57:22,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:22,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {3472#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {3472#true} is VALID [2022-02-20 18:57:22,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {3472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {3472#true} is VALID [2022-02-20 18:57:22,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {3472#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {3472#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {3472#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {3472#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {3472#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {3472#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {3472#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {3472#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {3472#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {3472#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {3472#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {3472#true} is VALID [2022-02-20 18:57:22,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {3472#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {3472#true} is VALID [2022-02-20 18:57:22,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#true} assume ~id1~0 != ~id2~0; {3472#true} is VALID [2022-02-20 18:57:22,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {3472#true} assume ~id1~0 != ~id3~0; {3472#true} is VALID [2022-02-20 18:57:22,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {3472#true} assume ~id2~0 != ~id3~0; {3472#true} is VALID [2022-02-20 18:57:22,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {3472#true} assume ~id1~0 >= 0; {3472#true} is VALID [2022-02-20 18:57:22,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {3472#true} assume ~id2~0 >= 0; {3472#true} is VALID [2022-02-20 18:57:22,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {3472#true} assume ~id3~0 >= 0; {3472#true} is VALID [2022-02-20 18:57:22,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {3472#true} assume 0 == ~r1~0 % 256; {3472#true} is VALID [2022-02-20 18:57:22,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#true} assume 0 == ~r2~0 % 256; {3472#true} is VALID [2022-02-20 18:57:22,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#true} assume 0 == ~r3~0 % 256; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max1~0 == ~id1~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max2~0 == ~id2~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~max3~0 == ~id3~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st1~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st2~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~st3~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl1~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl2~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~nl3~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode1~0 % 256; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode2~0 % 256; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 == ~mode3~0 % 256; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax1~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax2~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode1~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r1~0 % 256 < 2; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep12~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep13~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode1~0 := 1; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode2~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume ~r2~0 % 256 < 2; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep21~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~ep23~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} ~mode2~0 := 1; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !!(0 == ~mode3~0 % 256); {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} is VALID [2022-02-20 18:57:22,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {3474#(<= ~r3~0 (* 256 (div ~r3~0 256)))} assume !(~r3~0 % 256 < 2); {3473#false} is VALID [2022-02-20 18:57:22,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {3473#false} ~mode3~0 := 1; {3473#false} is VALID [2022-02-20 18:57:22,205 INFO L290 TraceCheckUtils]: 55: Hoare triple {3473#false} ~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;havoc main_~check__tmp~0#1; {3473#false} is VALID [2022-02-20 18:57:22,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {3473#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {3473#false} is VALID [2022-02-20 18:57:22,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {3473#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {3473#false} is VALID [2022-02-20 18:57:22,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {3473#false} assume 0 == main_~assert__arg~0#1 % 256; {3473#false} is VALID [2022-02-20 18:57:22,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {3473#false} assume !false; {3473#false} is VALID [2022-02-20 18:57:22,207 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:57:22,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:22,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495483661] [2022-02-20 18:57:22,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495483661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:22,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:22,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:57:22,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410656057] [2022-02-20 18:57:22,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:57:22,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:22,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:22,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:57:22,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:57:22,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:57:22,258 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:22,880 INFO L93 Difference]: Finished difference Result 1021 states and 1648 transitions. [2022-02-20 18:57:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:57:22,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-02-20 18:57:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-02-20 18:57:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2022-02-20 18:57:22,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 529 transitions. [2022-02-20 18:57:23,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:23,293 INFO L225 Difference]: With dead ends: 1021 [2022-02-20 18:57:23,294 INFO L226 Difference]: Without dead ends: 687 [2022-02-20 18:57:23,296 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:57:23,303 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 425 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:57:23,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 425 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-02-20 18:57:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2022-02-20 18:57:23,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:23,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 687 states. Second operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,566 INFO L74 IsIncluded]: Start isIncluded. First operand 687 states. Second operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,567 INFO L87 Difference]: Start difference. First operand 687 states. Second operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:23,595 INFO L93 Difference]: Finished difference Result 687 states and 1095 transitions. [2022-02-20 18:57:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1095 transitions. [2022-02-20 18:57:23,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:23,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:23,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 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 687 states. [2022-02-20 18:57:23,600 INFO L87 Difference]: Start difference. First operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 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 687 states. [2022-02-20 18:57:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:23,628 INFO L93 Difference]: Finished difference Result 687 states and 1095 transitions. [2022-02-20 18:57:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1095 transitions. [2022-02-20 18:57:23,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:23,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:23,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:23,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.6029411764705883) internal successors, (1090), 680 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1090 transitions. [2022-02-20 18:57:23,667 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1090 transitions. Word has length 60 [2022-02-20 18:57:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:23,668 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 1090 transitions. [2022-02-20 18:57:23,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1090 transitions. [2022-02-20 18:57:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 18:57:23,670 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:23,670 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] [2022-02-20 18:57:23,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:57:23,670 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash 333047117, now seen corresponding path program 1 times [2022-02-20 18:57:23,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:23,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67891930] [2022-02-20 18:57:23,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:23,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {7217#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {7217#true} is VALID [2022-02-20 18:57:23,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {7217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {7217#true} is VALID [2022-02-20 18:57:23,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {7217#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {7217#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {7217#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {7217#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {7217#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {7217#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {7217#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {7217#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {7217#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {7217#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {7217#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {7217#true} is VALID [2022-02-20 18:57:23,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {7217#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {7217#true} is VALID [2022-02-20 18:57:23,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {7217#true} assume ~id1~0 != ~id2~0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {7217#true} assume ~id1~0 != ~id3~0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {7217#true} assume ~id2~0 != ~id3~0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {7217#true} assume ~id1~0 >= 0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {7217#true} assume ~id2~0 >= 0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {7217#true} assume ~id3~0 >= 0; {7217#true} is VALID [2022-02-20 18:57:23,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {7217#true} assume 0 == ~r1~0 % 256; {7217#true} is VALID [2022-02-20 18:57:23,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {7217#true} assume 0 == ~r2~0 % 256; {7217#true} is VALID [2022-02-20 18:57:23,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {7217#true} assume 0 == ~r3~0 % 256; {7217#true} is VALID [2022-02-20 18:57:23,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {7217#true} assume ~max1~0 == ~id1~0; {7217#true} is VALID [2022-02-20 18:57:23,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {7217#true} assume ~max2~0 == ~id2~0; {7217#true} is VALID [2022-02-20 18:57:23,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {7217#true} assume ~max3~0 == ~id3~0; {7217#true} is VALID [2022-02-20 18:57:23,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {7217#true} assume 0 == ~st1~0; {7219#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:23,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {7219#(<= ~st1~0 0)} assume 0 == ~st2~0; {7220#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {7220#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl1~0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl2~0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~nl3~0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode1~0 := 1; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,807 INFO L290 TraceCheckUtils]: 47: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,807 INFO L290 TraceCheckUtils]: 48: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode2~0 := 1; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~mode3~0 := 1; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:23,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {7221#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {7218#false} is VALID [2022-02-20 18:57:23,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {7218#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {7218#false} is VALID [2022-02-20 18:57:23,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {7218#false} assume 0 == main_~assert__arg~0#1 % 256; {7218#false} is VALID [2022-02-20 18:57:23,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {7218#false} assume !false; {7218#false} is VALID [2022-02-20 18:57:23,812 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:57:23,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:23,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67891930] [2022-02-20 18:57:23,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67891930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:23,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:23,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:57:23,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341666422] [2022-02-20 18:57:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:57:23,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:23,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:23,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:23,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:57:23,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:23,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:57:23,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:57:23,858 INFO L87 Difference]: Start difference. First operand 681 states and 1090 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:27,008 INFO L93 Difference]: Finished difference Result 2973 states and 4848 transitions. [2022-02-20 18:57:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:57:27,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-02-20 18:57:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1175 transitions. [2022-02-20 18:57:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1175 transitions. [2022-02-20 18:57:27,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1175 transitions. [2022-02-20 18:57:27,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1175 edges. 1175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:28,179 INFO L225 Difference]: With dead ends: 2973 [2022-02-20 18:57:28,179 INFO L226 Difference]: Without dead ends: 2343 [2022-02-20 18:57:28,180 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:57:28,181 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1026 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:57:28,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1026 Valid, 1572 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:57:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-02-20 18:57:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 1233. [2022-02-20 18:57:29,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:29,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2343 states. Second operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,138 INFO L74 IsIncluded]: Start isIncluded. First operand 2343 states. Second operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,140 INFO L87 Difference]: Start difference. First operand 2343 states. Second operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:29,382 INFO L93 Difference]: Finished difference Result 2343 states and 3801 transitions. [2022-02-20 18:57:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3801 transitions. [2022-02-20 18:57:29,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:29,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:29,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 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 2343 states. [2022-02-20 18:57:29,391 INFO L87 Difference]: Start difference. First operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 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 2343 states. [2022-02-20 18:57:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:29,596 INFO L93 Difference]: Finished difference Result 2343 states and 3801 transitions. [2022-02-20 18:57:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3801 transitions. [2022-02-20 18:57:29,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:29,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:29,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:29,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1232 states have (on average 1.6112012987012987) internal successors, (1985), 1232 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1985 transitions. [2022-02-20 18:57:29,684 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1985 transitions. Word has length 62 [2022-02-20 18:57:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:29,684 INFO L470 AbstractCegarLoop]: Abstraction has 1233 states and 1985 transitions. [2022-02-20 18:57:29,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1985 transitions. [2022-02-20 18:57:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 18:57:29,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:29,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:29,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:57:29,686 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1672021844, now seen corresponding path program 1 times [2022-02-20 18:57:29,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:29,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093097573] [2022-02-20 18:57:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:29,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:29,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {17792#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {17792#true} is VALID [2022-02-20 18:57:29,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {17792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {17792#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 3: Hoare triple {17792#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {17792#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {17792#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {17792#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {17792#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {17792#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {17792#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {17792#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {17792#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {17792#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {17792#true} is VALID [2022-02-20 18:57:29,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {17792#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {17792#true} is VALID [2022-02-20 18:57:29,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {17792#true} assume ~id1~0 != ~id2~0; {17792#true} is VALID [2022-02-20 18:57:29,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {17792#true} assume ~id1~0 != ~id3~0; {17792#true} is VALID [2022-02-20 18:57:29,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {17792#true} assume ~id2~0 != ~id3~0; {17792#true} is VALID [2022-02-20 18:57:29,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {17792#true} assume ~id1~0 >= 0; {17792#true} is VALID [2022-02-20 18:57:29,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {17792#true} assume ~id2~0 >= 0; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {17792#true} assume ~id3~0 >= 0; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {17792#true} assume 0 == ~r1~0 % 256; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {17792#true} assume 0 == ~r2~0 % 256; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {17792#true} assume 0 == ~r3~0 % 256; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {17792#true} assume ~max1~0 == ~id1~0; {17792#true} is VALID [2022-02-20 18:57:29,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {17792#true} assume ~max2~0 == ~id2~0; {17792#true} is VALID [2022-02-20 18:57:29,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {17792#true} assume ~max3~0 == ~id3~0; {17792#true} is VALID [2022-02-20 18:57:29,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {17792#true} assume 0 == ~st1~0; {17794#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:29,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {17794#(<= ~st1~0 0)} assume 0 == ~st2~0; {17794#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:29,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {17794#(<= ~st1~0 0)} assume 0 == ~st3~0; {17794#(<= ~st1~0 0)} is VALID [2022-02-20 18:57:29,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {17794#(<= ~st1~0 0)} assume 0 == ~nl1~0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl2~0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~nl3~0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode1~0 % 256; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax1~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax2~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode1~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r1~0 % 256 < 2; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep12~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep13~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode1~0 := 1; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode2~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r2~0 % 256 < 2; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep21~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep23~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode2~0 := 1; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,839 INFO L290 TraceCheckUtils]: 52: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~mode3~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~r3~0 % 256 < 2; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep31~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !!(0 == ~ep32~0 % 256); {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} ~mode3~0 := 1; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} ~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;havoc main_~check__tmp~0#1; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {17795#(<= (+ ~nl1~0 ~st1~0) 0)} is VALID [2022-02-20 18:57:29,842 INFO L290 TraceCheckUtils]: 59: Hoare triple {17795#(<= (+ ~nl1~0 ~st1~0) 0)} assume !(~st1~0 + ~nl1~0 <= 1);main_~check__tmp~0#1 := 0; {17793#false} is VALID [2022-02-20 18:57:29,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {17793#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {17793#false} is VALID [2022-02-20 18:57:29,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {17793#false} assume 0 == main_~assert__arg~0#1 % 256; {17793#false} is VALID [2022-02-20 18:57:29,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {17793#false} assume !false; {17793#false} is VALID [2022-02-20 18:57:29,843 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:57:29,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:29,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093097573] [2022-02-20 18:57:29,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093097573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:29,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:29,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:29,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186381656] [2022-02-20 18:57:29,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:57:29,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:29,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:29,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:29,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:29,887 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:29,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:29,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:29,888 INFO L87 Difference]: Start difference. First operand 1233 states and 1985 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:32,694 INFO L93 Difference]: Finished difference Result 3613 states and 5881 transitions. [2022-02-20 18:57:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-02-20 18:57:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:32,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 701 transitions. [2022-02-20 18:57:33,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:33,348 INFO L225 Difference]: With dead ends: 3613 [2022-02-20 18:57:33,348 INFO L226 Difference]: Without dead ends: 2431 [2022-02-20 18:57:33,349 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:57:33,350 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 456 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 769 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:57:33,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 769 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2022-02-20 18:57:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 1823. [2022-02-20 18:57:34,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:34,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2431 states. Second operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:34,750 INFO L74 IsIncluded]: Start isIncluded. First operand 2431 states. Second operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:34,753 INFO L87 Difference]: Start difference. First operand 2431 states. Second operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:34,954 INFO L93 Difference]: Finished difference Result 2431 states and 3951 transitions. [2022-02-20 18:57:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3951 transitions. [2022-02-20 18:57:34,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:34,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:34,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 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 2431 states. [2022-02-20 18:57:34,964 INFO L87 Difference]: Start difference. First operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 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 2431 states. [2022-02-20 18:57:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:35,163 INFO L93 Difference]: Finished difference Result 2431 states and 3951 transitions. [2022-02-20 18:57:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 3951 transitions. [2022-02-20 18:57:35,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:35,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:35,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:35,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 1.6169045005488474) internal successors, (2946), 1822 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2946 transitions. [2022-02-20 18:57:35,333 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2946 transitions. Word has length 63 [2022-02-20 18:57:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:35,333 INFO L470 AbstractCegarLoop]: Abstraction has 1823 states and 2946 transitions. [2022-02-20 18:57:35,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2946 transitions. [2022-02-20 18:57:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 18:57:35,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:35,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:35,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:57:35,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 235123444, now seen corresponding path program 1 times [2022-02-20 18:57:35,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:35,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002604932] [2022-02-20 18:57:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {30268#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {30268#true} is VALID [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {30268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {30268#true} is VALID [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {30268#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {30268#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {30268#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {30268#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {30268#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {30268#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {30268#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {30268#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {30268#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {30268#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {30268#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {30268#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {30268#true} assume ~id1~0 != ~id2~0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {30268#true} assume ~id1~0 != ~id3~0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {30268#true} assume ~id2~0 != ~id3~0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {30268#true} assume ~id1~0 >= 0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 18: Hoare triple {30268#true} assume ~id2~0 >= 0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {30268#true} assume ~id3~0 >= 0; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {30268#true} assume 0 == ~r1~0 % 256; {30268#true} is VALID [2022-02-20 18:57:35,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {30268#true} assume 0 == ~r2~0 % 256; {30268#true} is VALID [2022-02-20 18:57:35,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {30268#true} assume 0 == ~r3~0 % 256; {30268#true} is VALID [2022-02-20 18:57:35,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {30268#true} assume ~max1~0 == ~id1~0; {30268#true} is VALID [2022-02-20 18:57:35,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {30268#true} assume ~max2~0 == ~id2~0; {30268#true} is VALID [2022-02-20 18:57:35,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {30268#true} assume ~max3~0 == ~id3~0; {30268#true} is VALID [2022-02-20 18:57:35,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {30268#true} assume 0 == ~st1~0; {30268#true} is VALID [2022-02-20 18:57:35,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {30268#true} assume 0 == ~st2~0; {30270#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:35,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {30270#(<= ~st2~0 0)} assume 0 == ~st3~0; {30270#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:35,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {30270#(<= ~st2~0 0)} assume 0 == ~nl1~0; {30270#(<= ~st2~0 0)} is VALID [2022-02-20 18:57:35,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {30270#(<= ~st2~0 0)} assume 0 == ~nl2~0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~nl3~0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode1~0 % 256; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode2~0 % 256; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 == ~mode3~0 % 256; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax1~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax2~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode1~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r1~0 % 256 < 2; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep12~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,435 INFO L290 TraceCheckUtils]: 43: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep13~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode1~0 := 1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,435 INFO L290 TraceCheckUtils]: 45: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode2~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r2~0 % 256 < 2; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,437 INFO L290 TraceCheckUtils]: 48: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep21~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep23~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,437 INFO L290 TraceCheckUtils]: 50: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode2~0 := 1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~mode3~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~r3~0 % 256 < 2; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep31~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !!(0 == ~ep32~0 % 256); {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} ~mode3~0 := 1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} ~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;havoc main_~check__tmp~0#1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {30271#(<= (+ ~nl2~0 ~st2~0) 0)} is VALID [2022-02-20 18:57:35,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {30271#(<= (+ ~nl2~0 ~st2~0) 0)} assume !(~st2~0 + ~nl2~0 <= 1);main_~check__tmp~0#1 := 0; {30269#false} is VALID [2022-02-20 18:57:35,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {30269#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {30269#false} is VALID [2022-02-20 18:57:35,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {30269#false} assume 0 == main_~assert__arg~0#1 % 256; {30269#false} is VALID [2022-02-20 18:57:35,442 INFO L290 TraceCheckUtils]: 63: Hoare triple {30269#false} assume !false; {30269#false} is VALID [2022-02-20 18:57:35,442 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:57:35,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:35,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002604932] [2022-02-20 18:57:35,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002604932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:35,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:35,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:35,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754931687] [2022-02-20 18:57:35,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:35,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:35,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:35,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:35,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:35,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:35,484 INFO L87 Difference]: Start difference. First operand 1823 states and 2946 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:40,175 INFO L93 Difference]: Finished difference Result 5307 states and 8625 transitions. [2022-02-20 18:57:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-02-20 18:57:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:40,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 701 transitions. [2022-02-20 18:57:40,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:41,075 INFO L225 Difference]: With dead ends: 5307 [2022-02-20 18:57:41,075 INFO L226 Difference]: Without dead ends: 3535 [2022-02-20 18:57:41,077 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:57:41,078 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 456 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 711 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:57:41,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [456 Valid, 711 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2022-02-20 18:57:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 2667. [2022-02-20 18:57:43,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:43,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3535 states. Second operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:43,768 INFO L74 IsIncluded]: Start isIncluded. First operand 3535 states. Second operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:43,770 INFO L87 Difference]: Start difference. First operand 3535 states. Second operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:44,138 INFO L93 Difference]: Finished difference Result 3535 states and 5728 transitions. [2022-02-20 18:57:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5728 transitions. [2022-02-20 18:57:44,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:44,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:44,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 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 3535 states. [2022-02-20 18:57:44,147 INFO L87 Difference]: Start difference. First operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 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 3535 states. [2022-02-20 18:57:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:44,563 INFO L93 Difference]: Finished difference Result 3535 states and 5728 transitions. [2022-02-20 18:57:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5728 transitions. [2022-02-20 18:57:44,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:57:44,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:57:44,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:57:44,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:57:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2666 states have (on average 1.6151537884471119) internal successors, (4306), 2666 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4306 transitions. [2022-02-20 18:57:44,921 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4306 transitions. Word has length 64 [2022-02-20 18:57:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:57:44,921 INFO L470 AbstractCegarLoop]: Abstraction has 2667 states and 4306 transitions. [2022-02-20 18:57:44,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:44,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4306 transitions. [2022-02-20 18:57:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 18:57:44,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:57:44,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:57:44,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:57:44,923 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:57:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:57:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1354495973, now seen corresponding path program 1 times [2022-02-20 18:57:44,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:57:44,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864001304] [2022-02-20 18:57:44,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:57:44,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:57:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:57:45,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {48537#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {48537#true} is VALID [2022-02-20 18:57:45,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {48537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {48537#true} is VALID [2022-02-20 18:57:45,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {48537#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {48537#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {48537#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {48537#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {48537#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {48537#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {48537#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {48537#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {48537#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {48537#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {48537#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {48537#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {48537#true} assume ~id1~0 != ~id2~0; {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {48537#true} assume ~id1~0 != ~id3~0; {48537#true} is VALID [2022-02-20 18:57:45,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {48537#true} assume ~id2~0 != ~id3~0; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {48537#true} assume ~id1~0 >= 0; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {48537#true} assume ~id2~0 >= 0; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {48537#true} assume ~id3~0 >= 0; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {48537#true} assume 0 == ~r1~0 % 256; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {48537#true} assume 0 == ~r2~0 % 256; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {48537#true} assume 0 == ~r3~0 % 256; {48537#true} is VALID [2022-02-20 18:57:45,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {48537#true} assume ~max1~0 == ~id1~0; {48537#true} is VALID [2022-02-20 18:57:45,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {48537#true} assume ~max2~0 == ~id2~0; {48537#true} is VALID [2022-02-20 18:57:45,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {48537#true} assume ~max3~0 == ~id3~0; {48537#true} is VALID [2022-02-20 18:57:45,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {48537#true} assume 0 == ~st1~0; {48537#true} is VALID [2022-02-20 18:57:45,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {48537#true} assume 0 == ~st2~0; {48537#true} is VALID [2022-02-20 18:57:45,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {48537#true} assume 0 == ~st3~0; {48539#(<= ~st3~0 0)} is VALID [2022-02-20 18:57:45,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {48539#(<= ~st3~0 0)} assume 0 == ~nl1~0; {48539#(<= ~st3~0 0)} is VALID [2022-02-20 18:57:45,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {48539#(<= ~st3~0 0)} assume 0 == ~nl2~0; {48539#(<= ~st3~0 0)} is VALID [2022-02-20 18:57:45,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {48539#(<= ~st3~0 0)} assume 0 == ~nl3~0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode1~0 % 256; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode2~0 % 256; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 == ~mode3~0 % 256; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax1~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax2~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode1~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r1~0 % 256 < 2; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep12~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep13~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode1~0 := 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,021 INFO L290 TraceCheckUtils]: 46: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode2~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r2~0 % 256 < 2; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep21~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep23~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,022 INFO L290 TraceCheckUtils]: 50: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode2~0 := 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~mode3~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~r3~0 % 256 < 2; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep31~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !!(0 == ~ep32~0 % 256); {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} ~mode3~0 := 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} ~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;havoc main_~check__tmp~0#1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,025 INFO L290 TraceCheckUtils]: 58: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {48540#(<= (+ ~nl3~0 ~st3~0) 0)} is VALID [2022-02-20 18:57:45,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {48540#(<= (+ ~nl3~0 ~st3~0) 0)} assume !(~st3~0 + ~nl3~0 <= 1);main_~check__tmp~0#1 := 0; {48538#false} is VALID [2022-02-20 18:57:45,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {48538#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {48538#false} is VALID [2022-02-20 18:57:45,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {48538#false} assume 0 == main_~assert__arg~0#1 % 256; {48538#false} is VALID [2022-02-20 18:57:45,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {48538#false} assume !false; {48538#false} is VALID [2022-02-20 18:57:45,028 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:57:45,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:57:45,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864001304] [2022-02-20 18:57:45,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864001304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:57:45,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:57:45,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:57:45,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993883794] [2022-02-20 18:57:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:57:45,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:57:45,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:57:45,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:45,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:45,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:57:45,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:57:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:57:45,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:57:45,070 INFO L87 Difference]: Start difference. First operand 2667 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:57:53,628 INFO L93 Difference]: Finished difference Result 7707 states and 12501 transitions. [2022-02-20 18:57:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:57:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-20 18:57:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:57:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 701 transitions. [2022-02-20 18:57:53,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 701 transitions. [2022-02-20 18:57:54,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:57:55,102 INFO L225 Difference]: With dead ends: 7707 [2022-02-20 18:57:55,102 INFO L226 Difference]: Without dead ends: 5091 [2022-02-20 18:57:55,105 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:57:55,106 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 454 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 754 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:57:55,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 754 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:57:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2022-02-20 18:57:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 3863. [2022-02-20 18:57:59,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:57:59,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5091 states. Second operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:59,768 INFO L74 IsIncluded]: Start isIncluded. First operand 5091 states. Second operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:57:59,773 INFO L87 Difference]: Start difference. First operand 5091 states. Second operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:00,565 INFO L93 Difference]: Finished difference Result 5091 states and 8236 transitions. [2022-02-20 18:58:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8236 transitions. [2022-02-20 18:58:00,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:00,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:00,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 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 5091 states. [2022-02-20 18:58:00,577 INFO L87 Difference]: Start difference. First operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 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 5091 states. [2022-02-20 18:58:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:01,303 INFO L93 Difference]: Finished difference Result 5091 states and 8236 transitions. [2022-02-20 18:58:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8236 transitions. [2022-02-20 18:58:01,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:58:01,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:58:01,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:58:01,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:58:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3862 states have (on average 1.6126359399274988) internal successors, (6228), 3862 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 6228 transitions. [2022-02-20 18:58:01,961 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 6228 transitions. Word has length 65 [2022-02-20 18:58:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:58:01,962 INFO L470 AbstractCegarLoop]: Abstraction has 3863 states and 6228 transitions. [2022-02-20 18:58:01,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 18:58:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 6228 transitions. [2022-02-20 18:58:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 18:58:01,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:58:01,963 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:58:01,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:58:01,963 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:58:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:58:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1658042238, now seen corresponding path program 1 times [2022-02-20 18:58:01,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:58:01,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272463990] [2022-02-20 18:58:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:58:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:58:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:58:02,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {75005#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(59, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1921~0 := 0;~__return_2070~0 := 0; {75005#true} is VALID [2022-02-20 18:58:02,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {75005#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~newmax1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;assume -128 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 127;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~nl2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~m2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~max2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~newmax2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~id3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~r3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~nl3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume -128 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 127;~m3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~max3~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~mode3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~newmax3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {75005#true} is VALID [2022-02-20 18:58:02,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {75005#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {75005#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {75005#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {75005#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {75005#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {75005#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {75005#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {75005#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {75005#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {75005#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {75005#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {75005#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {75005#true} assume ~id1~0 != ~id2~0; {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {75005#true} assume ~id1~0 != ~id3~0; {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {75005#true} assume ~id2~0 != ~id3~0; {75005#true} is VALID [2022-02-20 18:58:02,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {75005#true} assume ~id1~0 >= 0; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {75005#true} assume ~id2~0 >= 0; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {75005#true} assume ~id3~0 >= 0; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {75005#true} assume 0 == ~r1~0 % 256; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {75005#true} assume 0 == ~r2~0 % 256; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {75005#true} assume 0 == ~r3~0 % 256; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {75005#true} assume ~max1~0 == ~id1~0; {75005#true} is VALID [2022-02-20 18:58:02,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {75005#true} assume ~max2~0 == ~id2~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {75005#true} assume ~max3~0 == ~id3~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {75005#true} assume 0 == ~st1~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {75005#true} assume 0 == ~st2~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {75005#true} assume 0 == ~st3~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {75005#true} assume 0 == ~nl1~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {75005#true} assume 0 == ~nl2~0; {75005#true} is VALID [2022-02-20 18:58:02,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {75005#true} assume 0 == ~nl3~0; {75005#true} is VALID [2022-02-20 18:58:02,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {75005#true} assume 0 == ~mode1~0 % 256; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax1~0 % 256); {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax2~0 % 256); {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~newmax3~0 % 256);main_~init__tmp___5~0#1 := 1;~__return_1921~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1921~0; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != main_~main__i2~0#1;~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_~main__i2~0#1 := 0; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} havoc main_~node1__newmax~0#1;main_~node1__newmax~0#1 := 0; {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {75007#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == ~mode1~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {75006#false} assume !(255 == ~r1~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {75006#false} ~r1~0 := 1 + ~r1~0 % 256; {75006#false} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {75006#false} assume !!(0 == ~ep21~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {75006#false} assume !!(0 == ~ep31~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {75006#false} ~newmax1~0 := main_~node1__newmax~0#1; {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {75006#false} assume 2 == ~r1~0 % 256; {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {75006#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {75006#false} ~mode1~0 := 0; {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {75006#false} havoc main_~node2__newmax~0#1;main_~node2__newmax~0#1 := 0; {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {75006#false} assume !!(0 == ~mode2~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {75006#false} assume ~r2~0 % 256 < 2; {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {75006#false} assume !!(0 == ~ep21~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {75006#false} assume !!(0 == ~ep23~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {75006#false} ~mode2~0 := 1; {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {75006#false} havoc main_~node3__newmax~0#1;main_~node3__newmax~0#1 := 0; {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {75006#false} assume !!(0 == ~mode3~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {75006#false} assume ~r3~0 % 256 < 2; {75006#false} is VALID [2022-02-20 18:58:02,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {75006#false} assume !!(0 == ~ep31~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {75006#false} assume !!(0 == ~ep32~0 % 256); {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 60: Hoare triple {75006#false} ~mode3~0 := 1; {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 61: Hoare triple {75006#false} ~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;havoc main_~check__tmp~0#1; {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 62: Hoare triple {75006#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);main_~check__tmp~0#1 := 0; {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {75006#false} ~__return_2070~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_2070~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {75006#false} assume 0 == main_~assert__arg~0#1 % 256; {75006#false} is VALID [2022-02-20 18:58:02,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {75006#false} assume !false; {75006#false} is VALID [2022-02-20 18:58:02,041 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:58:02,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:58:02,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272463990] [2022-02-20 18:58:02,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272463990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:58:02,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:58:02,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:58:02,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717495734] [2022-02-20 18:58:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:58:02,042 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:58:02,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:58:02,042 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:58:02,081 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:58:02,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:58:02,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:58:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:58:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:58:02,081 INFO L87 Difference]: Start difference. First operand 3863 states and 6228 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:58:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:58:12,240 INFO L93 Difference]: Finished difference Result 8640 states and 14034 transitions. [2022-02-20 18:58:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:58:12,241 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:58:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:58:12,241 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:58:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2022-02-20 18:58:12,243 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:58:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2022-02-20 18:58:12,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 503 transitions. [2022-02-20 18:58:12,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:58:13,795 INFO L225 Difference]: With dead ends: 8640 [2022-02-20 18:58:13,795 INFO L226 Difference]: Without dead ends: 5875 [2022-02-20 18:58:13,798 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:58:13,799 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 138 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 524 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:58:13,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 524 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:58:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states.