./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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.2.ufo.UNBOUNDED.pals.c.v+nlh-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 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 07:35:04,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:35:04,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:35:04,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:35:04,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:35:04,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:35:04,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:35:04,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:35:04,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:35:04,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:35:04,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:35:04,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:35:04,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:35:04,324 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:35:04,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:35:04,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:35:04,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:35:04,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:35:04,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:35:04,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:35:04,335 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:35:04,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:35:04,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:35:04,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:35:04,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:35:04,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:35:04,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:35:04,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:35:04,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:35:04,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:35:04,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:35:04,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:35:04,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:35:04,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:35:04,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:35:04,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:35:04,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:35:04,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:35:04,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:35:04,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:35:04,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:35:04,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:35:04,352 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 07:35:04,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:35:04,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:35:04,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:35:04,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:35:04,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:35:04,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:35:04,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:35:04,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:35:04,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:35:04,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:35:04,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:35:04,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:35:04,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:35:04,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:35:04,379 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:35:04,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:35:04,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:35:04,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:35:04,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:35:04,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:35:04,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:35:04,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:35:04,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:35:04,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 07:35:04,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 07:35:04,381 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:35:04,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:35:04,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:35:04,382 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 -> 93af4e6a9c0eb04ce4865a35985b5a12937072c2a8c22ec9da868c5c828002bb [2022-07-12 07:35:04,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:35:04,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:35:04,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:35:04,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:35:04,618 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:35:04,619 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-07-12 07:35:04,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f429fd9/9afda4d01cea4c859bd7359036882c23/FLAGd4a12f012 [2022-07-12 07:35:05,014 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:35:05,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-07-12 07:35:05,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f429fd9/9afda4d01cea4c859bd7359036882c23/FLAGd4a12f012 [2022-07-12 07:35:05,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70f429fd9/9afda4d01cea4c859bd7359036882c23 [2022-07-12 07:35:05,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:35:05,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:35:05,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:35:05,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:35:05,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:35:05,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4971eb6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05, skipping insertion in model container [2022-07-12 07:35:05,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:35:05,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:35:05,637 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2022-07-12 07:35:05,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:35:05,692 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:35:05,736 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[10668,10681] [2022-07-12 07:35:05,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:35:05,791 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:35:05,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05 WrapperNode [2022-07-12 07:35:05,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:35:05,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:35:05,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:35:05,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:35:05,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,858 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 952 [2022-07-12 07:35:05,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:35:05,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:35:05,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:35:05,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:35:05,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:35:05,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:35:05,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:35:05,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:35:05,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (1/1) ... [2022-07-12 07:35:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:35:05,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:35:05,924 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-07-12 07:35:05,925 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-07-12 07:35:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:35:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 07:35:05,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:35:05,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:35:06,068 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:35:06,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:35:06,649 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:35:06,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:35:06,660 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 07:35:06,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:35:06 BoogieIcfgContainer [2022-07-12 07:35:06,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:35:06,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:35:06,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:35:06,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:35:06,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:35:05" (1/3) ... [2022-07-12 07:35:06,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d549aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:35:06, skipping insertion in model container [2022-07-12 07:35:06,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:35:05" (2/3) ... [2022-07-12 07:35:06,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d549aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:35:06, skipping insertion in model container [2022-07-12 07:35:06,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:35:06" (3/3) ... [2022-07-12 07:35:06,674 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-07-12 07:35:06,684 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:35:06,684 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:35:06,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:35:06,741 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@747d7c8f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8173102 [2022-07-12 07:35:06,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:35:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 07:35:06,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:06,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:06,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1005429677, now seen corresponding path program 1 times [2022-07-12 07:35:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:06,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818128065] [2022-07-12 07:35:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:07,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818128065] [2022-07-12 07:35:07,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818128065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:07,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:07,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:07,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875150670] [2022-07-12 07:35:07,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:07,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:07,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:07,118 INFO L87 Difference]: Start difference. First operand has 247 states, 245 states have (on average 1.7591836734693878) internal successors, (431), 246 states have internal predecessors, (431), 0 states have call successors, (0), 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 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:07,278 INFO L93 Difference]: Finished difference Result 714 states and 1248 transitions. [2022-07-12 07:35:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2022-07-12 07:35:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:07,295 INFO L225 Difference]: With dead ends: 714 [2022-07-12 07:35:07,296 INFO L226 Difference]: Without dead ends: 470 [2022-07-12 07:35:07,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:07,304 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 1005 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:07,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 993 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-12 07:35:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2022-07-12 07:35:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4753747323340471) internal successors, (689), 467 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 689 transitions. [2022-07-12 07:35:07,367 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 689 transitions. Word has length 101 [2022-07-12 07:35:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:07,368 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 689 transitions. [2022-07-12 07:35:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 689 transitions. [2022-07-12 07:35:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 07:35:07,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:07,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:07,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 07:35:07,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:07,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:07,374 INFO L85 PathProgramCache]: Analyzing trace with hash -769716679, now seen corresponding path program 1 times [2022-07-12 07:35:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:07,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510877263] [2022-07-12 07:35:07,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:07,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510877263] [2022-07-12 07:35:07,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510877263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:07,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:07,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234840405] [2022-07-12 07:35:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:07,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:07,429 INFO L87 Difference]: Start difference. First operand 468 states and 689 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:07,473 INFO L93 Difference]: Finished difference Result 1366 states and 2005 transitions. [2022-07-12 07:35:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2022-07-12 07:35:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:07,477 INFO L225 Difference]: With dead ends: 1366 [2022-07-12 07:35:07,477 INFO L226 Difference]: Without dead ends: 926 [2022-07-12 07:35:07,482 INFO L412 NwaCegarLoop]: 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-07-12 07:35:07,483 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 352 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:07,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1041 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-07-12 07:35:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 470. [2022-07-12 07:35:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.4733475479744136) internal successors, (691), 469 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 691 transitions. [2022-07-12 07:35:07,527 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 691 transitions. Word has length 102 [2022-07-12 07:35:07,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:07,529 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 691 transitions. [2022-07-12 07:35:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 691 transitions. [2022-07-12 07:35:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:35:07,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:07,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 07:35:07,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1142488916, now seen corresponding path program 1 times [2022-07-12 07:35:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:07,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106128871] [2022-07-12 07:35:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:07,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106128871] [2022-07-12 07:35:07,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106128871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:07,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:07,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311251319] [2022-07-12 07:35:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:07,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:07,605 INFO L87 Difference]: Start difference. First operand 470 states and 691 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:07,687 INFO L93 Difference]: Finished difference Result 977 states and 1492 transitions. [2022-07-12 07:35:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:07,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-07-12 07:35:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:07,691 INFO L225 Difference]: With dead ends: 977 [2022-07-12 07:35:07,691 INFO L226 Difference]: Without dead ends: 634 [2022-07-12 07:35:07,694 INFO L412 NwaCegarLoop]: 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-07-12 07:35:07,697 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 233 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:07,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 745 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-07-12 07:35:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 618. [2022-07-12 07:35:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.5153970826580228) internal successors, (935), 617 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 935 transitions. [2022-07-12 07:35:07,745 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 935 transitions. Word has length 103 [2022-07-12 07:35:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:07,745 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 935 transitions. [2022-07-12 07:35:07,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 935 transitions. [2022-07-12 07:35:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 07:35:07,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:07,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:07,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 07:35:07,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -362955380, now seen corresponding path program 1 times [2022-07-12 07:35:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:07,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749217896] [2022-07-12 07:35:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:07,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749217896] [2022-07-12 07:35:07,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749217896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:07,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:07,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:07,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537881093] [2022-07-12 07:35:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:07,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:07,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:07,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:07,900 INFO L87 Difference]: Start difference. First operand 618 states and 935 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:08,031 INFO L93 Difference]: Finished difference Result 1766 states and 2661 transitions. [2022-07-12 07:35:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2022-07-12 07:35:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:08,037 INFO L225 Difference]: With dead ends: 1766 [2022-07-12 07:35:08,037 INFO L226 Difference]: Without dead ends: 1178 [2022-07-12 07:35:08,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:08,043 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 760 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:08,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 858 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-07-12 07:35:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2022-07-12 07:35:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.4978723404255319) internal successors, (1760), 1175 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1760 transitions. [2022-07-12 07:35:08,115 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1760 transitions. Word has length 103 [2022-07-12 07:35:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:08,116 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1760 transitions. [2022-07-12 07:35:08,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1760 transitions. [2022-07-12 07:35:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 07:35:08,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:08,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:08,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 07:35:08,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1797210952, now seen corresponding path program 1 times [2022-07-12 07:35:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:08,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141930162] [2022-07-12 07:35:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:08,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141930162] [2022-07-12 07:35:08,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141930162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:08,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:08,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407913534] [2022-07-12 07:35:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:08,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:08,182 INFO L87 Difference]: Start difference. First operand 1176 states and 1760 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:08,304 INFO L93 Difference]: Finished difference Result 3452 states and 5160 transitions. [2022-07-12 07:35:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:08,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-07-12 07:35:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:08,312 INFO L225 Difference]: With dead ends: 3452 [2022-07-12 07:35:08,312 INFO L226 Difference]: Without dead ends: 2320 [2022-07-12 07:35:08,314 INFO L412 NwaCegarLoop]: 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-07-12 07:35:08,315 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 336 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:08,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1046 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2022-07-12 07:35:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 1180. [2022-07-12 07:35:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 1.4961832061068703) internal successors, (1764), 1179 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1764 transitions. [2022-07-12 07:35:08,393 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1764 transitions. Word has length 104 [2022-07-12 07:35:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1764 transitions. [2022-07-12 07:35:08,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1764 transitions. [2022-07-12 07:35:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 07:35:08,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:08,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 07:35:08,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 978474865, now seen corresponding path program 1 times [2022-07-12 07:35:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:08,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332668777] [2022-07-12 07:35:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332668777] [2022-07-12 07:35:08,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332668777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:08,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833312312] [2022-07-12 07:35:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:08,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:08,444 INFO L87 Difference]: Start difference. First operand 1180 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:08,577 INFO L93 Difference]: Finished difference Result 2640 states and 4114 transitions. [2022-07-12 07:35:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:08,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-07-12 07:35:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:08,582 INFO L225 Difference]: With dead ends: 2640 [2022-07-12 07:35:08,582 INFO L226 Difference]: Without dead ends: 1744 [2022-07-12 07:35:08,584 INFO L412 NwaCegarLoop]: 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-07-12 07:35:08,584 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 241 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:08,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 729 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2022-07-12 07:35:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1690. [2022-07-12 07:35:08,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 1.5429248075784487) internal successors, (2606), 1689 states have internal predecessors, (2606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2606 transitions. [2022-07-12 07:35:08,690 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2606 transitions. Word has length 105 [2022-07-12 07:35:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:08,690 INFO L495 AbstractCegarLoop]: Abstraction has 1690 states and 2606 transitions. [2022-07-12 07:35:08,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2606 transitions. [2022-07-12 07:35:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 07:35:08,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:08,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:08,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 07:35:08,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1850549439, now seen corresponding path program 1 times [2022-07-12 07:35:08,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:08,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314362913] [2022-07-12 07:35:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:08,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314362913] [2022-07-12 07:35:08,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314362913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:08,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:08,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242274351] [2022-07-12 07:35:08,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:08,728 INFO L87 Difference]: Start difference. First operand 1690 states and 2606 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:08,931 INFO L93 Difference]: Finished difference Result 4594 states and 7162 transitions. [2022-07-12 07:35:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:08,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-07-12 07:35:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:08,940 INFO L225 Difference]: With dead ends: 4594 [2022-07-12 07:35:08,940 INFO L226 Difference]: Without dead ends: 3236 [2022-07-12 07:35:08,942 INFO L412 NwaCegarLoop]: 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-07-12 07:35:08,942 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 280 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:08,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 980 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2022-07-12 07:35:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3234. [2022-07-12 07:35:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3234 states, 3233 states have (on average 1.530467058459635) internal successors, (4948), 3233 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 4948 transitions. [2022-07-12 07:35:09,161 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 4948 transitions. Word has length 105 [2022-07-12 07:35:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:09,162 INFO L495 AbstractCegarLoop]: Abstraction has 3234 states and 4948 transitions. [2022-07-12 07:35:09,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 4948 transitions. [2022-07-12 07:35:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 07:35:09,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:09,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:09,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 07:35:09,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:09,164 INFO L85 PathProgramCache]: Analyzing trace with hash -417340030, now seen corresponding path program 1 times [2022-07-12 07:35:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:09,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339145207] [2022-07-12 07:35:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:09,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339145207] [2022-07-12 07:35:09,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339145207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:09,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:09,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 07:35:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246890234] [2022-07-12 07:35:09,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:09,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:09,270 INFO L87 Difference]: Start difference. First operand 3234 states and 4948 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:09,654 INFO L93 Difference]: Finished difference Result 8716 states and 13341 transitions. [2022-07-12 07:35:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-07-12 07:35:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:09,669 INFO L225 Difference]: With dead ends: 8716 [2022-07-12 07:35:09,669 INFO L226 Difference]: Without dead ends: 5519 [2022-07-12 07:35:09,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:09,673 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 653 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:09,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1218 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2022-07-12 07:35:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5517. [2022-07-12 07:35:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5517 states, 5516 states have (on average 1.5159535895576504) internal successors, (8362), 5516 states have internal predecessors, (8362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 8362 transitions. [2022-07-12 07:35:10,060 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 8362 transitions. Word has length 105 [2022-07-12 07:35:10,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:10,060 INFO L495 AbstractCegarLoop]: Abstraction has 5517 states and 8362 transitions. [2022-07-12 07:35:10,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 8362 transitions. [2022-07-12 07:35:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 07:35:10,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:10,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 07:35:10,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:10,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash 540693227, now seen corresponding path program 1 times [2022-07-12 07:35:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915029325] [2022-07-12 07:35:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:10,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:10,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915029325] [2022-07-12 07:35:10,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915029325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:10,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:10,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869055053] [2022-07-12 07:35:10,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:10,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:10,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:10,130 INFO L87 Difference]: Start difference. First operand 5517 states and 8362 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:10,566 INFO L93 Difference]: Finished difference Result 11296 states and 16989 transitions. [2022-07-12 07:35:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-07-12 07:35:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:10,582 INFO L225 Difference]: With dead ends: 11296 [2022-07-12 07:35:10,582 INFO L226 Difference]: Without dead ends: 5896 [2022-07-12 07:35:10,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:10,589 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 698 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:10,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 881 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5896 states. [2022-07-12 07:35:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5896 to 5741. [2022-07-12 07:35:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5741 states, 5740 states have (on average 1.4993031358885018) internal successors, (8606), 5740 states have internal predecessors, (8606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 8606 transitions. [2022-07-12 07:35:11,091 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 8606 transitions. Word has length 105 [2022-07-12 07:35:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:11,091 INFO L495 AbstractCegarLoop]: Abstraction has 5741 states and 8606 transitions. [2022-07-12 07:35:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 8606 transitions. [2022-07-12 07:35:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 07:35:11,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:11,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:11,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 07:35:11,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 138743479, now seen corresponding path program 1 times [2022-07-12 07:35:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535272812] [2022-07-12 07:35:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:11,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535272812] [2022-07-12 07:35:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535272812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:11,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:11,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064811282] [2022-07-12 07:35:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:11,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:11,120 INFO L87 Difference]: Start difference. First operand 5741 states and 8606 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:11,844 INFO L93 Difference]: Finished difference Result 16497 states and 24904 transitions. [2022-07-12 07:35:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-12 07:35:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:11,868 INFO L225 Difference]: With dead ends: 16497 [2022-07-12 07:35:11,869 INFO L226 Difference]: Without dead ends: 11357 [2022-07-12 07:35:11,876 INFO L412 NwaCegarLoop]: 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-07-12 07:35:11,877 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 320 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:11,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 826 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11357 states. [2022-07-12 07:35:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11357 to 5757. [2022-07-12 07:35:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5757 states, 5756 states have (on average 1.4979152189020153) internal successors, (8622), 5756 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:12,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 8622 transitions. [2022-07-12 07:35:12,320 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 8622 transitions. Word has length 106 [2022-07-12 07:35:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:12,320 INFO L495 AbstractCegarLoop]: Abstraction has 5757 states and 8622 transitions. [2022-07-12 07:35:12,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 8622 transitions. [2022-07-12 07:35:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 07:35:12,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:12,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 07:35:12,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2082987062, now seen corresponding path program 1 times [2022-07-12 07:35:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:12,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650756835] [2022-07-12 07:35:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:12,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650756835] [2022-07-12 07:35:12,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650756835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:12,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:12,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401645932] [2022-07-12 07:35:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:12,386 INFO L87 Difference]: Start difference. First operand 5757 states and 8622 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:12,927 INFO L93 Difference]: Finished difference Result 11504 states and 17230 transitions. [2022-07-12 07:35:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-07-12 07:35:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:12,937 INFO L225 Difference]: With dead ends: 11504 [2022-07-12 07:35:12,937 INFO L226 Difference]: Without dead ends: 5755 [2022-07-12 07:35:12,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:12,945 INFO L413 NwaCegarLoop]: 401 mSDtfsCounter, 65 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:12,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2022-07-12 07:35:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5755. [2022-07-12 07:35:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5755 states, 5754 states have (on average 1.4977407021202642) internal successors, (8618), 5754 states have internal predecessors, (8618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5755 states to 5755 states and 8618 transitions. [2022-07-12 07:35:13,455 INFO L78 Accepts]: Start accepts. Automaton has 5755 states and 8618 transitions. Word has length 107 [2022-07-12 07:35:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:13,456 INFO L495 AbstractCegarLoop]: Abstraction has 5755 states and 8618 transitions. [2022-07-12 07:35:13,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5755 states and 8618 transitions. [2022-07-12 07:35:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 07:35:13,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:13,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:13,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 07:35:13,460 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:13,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 248103490, now seen corresponding path program 1 times [2022-07-12 07:35:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:13,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387247206] [2022-07-12 07:35:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387247206] [2022-07-12 07:35:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387247206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:13,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:13,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:13,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742823132] [2022-07-12 07:35:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:13,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:13,494 INFO L87 Difference]: Start difference. First operand 5755 states and 8618 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:14,107 INFO L93 Difference]: Finished difference Result 13045 states and 19796 transitions. [2022-07-12 07:35:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2022-07-12 07:35:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:14,120 INFO L225 Difference]: With dead ends: 13045 [2022-07-12 07:35:14,120 INFO L226 Difference]: Without dead ends: 8501 [2022-07-12 07:35:14,124 INFO L412 NwaCegarLoop]: 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-07-12 07:35:14,125 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 288 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 748 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8501 states. [2022-07-12 07:35:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8501 to 8499. [2022-07-12 07:35:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8499 states, 8498 states have (on average 1.476818074841139) internal successors, (12550), 8498 states have internal predecessors, (12550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8499 states to 8499 states and 12550 transitions. [2022-07-12 07:35:14,727 INFO L78 Accepts]: Start accepts. Automaton has 8499 states and 12550 transitions. Word has length 107 [2022-07-12 07:35:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:14,728 INFO L495 AbstractCegarLoop]: Abstraction has 8499 states and 12550 transitions. [2022-07-12 07:35:14,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8499 states and 12550 transitions. [2022-07-12 07:35:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 07:35:14,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:14,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:14,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 07:35:14,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1043025895, now seen corresponding path program 1 times [2022-07-12 07:35:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519361527] [2022-07-12 07:35:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:14,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519361527] [2022-07-12 07:35:14,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519361527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:14,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:14,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:35:14,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758041541] [2022-07-12 07:35:14,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:14,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:35:14,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:14,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:35:14,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:35:14,763 INFO L87 Difference]: Start difference. First operand 8499 states and 12550 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:15,791 INFO L93 Difference]: Finished difference Result 18359 states and 28094 transitions. [2022-07-12 07:35:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:35:15,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-07-12 07:35:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:15,808 INFO L225 Difference]: With dead ends: 18359 [2022-07-12 07:35:15,808 INFO L226 Difference]: Without dead ends: 12642 [2022-07-12 07:35:15,815 INFO L412 NwaCegarLoop]: 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-07-12 07:35:15,816 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 245 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:15,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 712 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12642 states. [2022-07-12 07:35:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12642 to 12180. [2022-07-12 07:35:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12180 states, 12179 states have (on average 1.5104688398062238) internal successors, (18396), 12179 states have internal predecessors, (18396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12180 states to 12180 states and 18396 transitions. [2022-07-12 07:35:17,024 INFO L78 Accepts]: Start accepts. Automaton has 12180 states and 18396 transitions. Word has length 109 [2022-07-12 07:35:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:17,024 INFO L495 AbstractCegarLoop]: Abstraction has 12180 states and 18396 transitions. [2022-07-12 07:35:17,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 12180 states and 18396 transitions. [2022-07-12 07:35:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 07:35:17,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:17,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:17,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 07:35:17,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:17,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash 211922380, now seen corresponding path program 1 times [2022-07-12 07:35:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:17,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344541935] [2022-07-12 07:35:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344541935] [2022-07-12 07:35:17,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344541935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:17,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:17,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343565235] [2022-07-12 07:35:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:17,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:17,073 INFO L87 Difference]: Start difference. First operand 12180 states and 18396 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:18,138 INFO L93 Difference]: Finished difference Result 23210 states and 35482 transitions. [2022-07-12 07:35:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:35:18,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-07-12 07:35:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:18,157 INFO L225 Difference]: With dead ends: 23210 [2022-07-12 07:35:18,158 INFO L226 Difference]: Without dead ends: 12180 [2022-07-12 07:35:18,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:35:18,173 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 886 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:18,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 374 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:35:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12180 states. [2022-07-12 07:35:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12180 to 12180. [2022-07-12 07:35:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12180 states, 12179 states have (on average 1.496838820921258) internal successors, (18230), 12179 states have internal predecessors, (18230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12180 states to 12180 states and 18230 transitions. [2022-07-12 07:35:19,291 INFO L78 Accepts]: Start accepts. Automaton has 12180 states and 18230 transitions. Word has length 110 [2022-07-12 07:35:19,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:19,292 INFO L495 AbstractCegarLoop]: Abstraction has 12180 states and 18230 transitions. [2022-07-12 07:35:19,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 12180 states and 18230 transitions. [2022-07-12 07:35:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 07:35:19,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:19,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 07:35:19,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:19,297 INFO L85 PathProgramCache]: Analyzing trace with hash 410270887, now seen corresponding path program 1 times [2022-07-12 07:35:19,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:19,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536644262] [2022-07-12 07:35:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:19,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:19,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536644262] [2022-07-12 07:35:19,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536644262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:19,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547435086] [2022-07-12 07:35:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:19,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:19,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:19,348 INFO L87 Difference]: Start difference. First operand 12180 states and 18230 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:21,410 INFO L93 Difference]: Finished difference Result 30759 states and 46380 transitions. [2022-07-12 07:35:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-07-12 07:35:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:21,436 INFO L225 Difference]: With dead ends: 30759 [2022-07-12 07:35:21,436 INFO L226 Difference]: Without dead ends: 18927 [2022-07-12 07:35:21,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:21,451 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 695 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:21,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 890 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2022-07-12 07:35:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 18925. [2022-07-12 07:35:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18925 states, 18924 states have (on average 1.4930247305009512) internal successors, (28254), 18924 states have internal predecessors, (28254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18925 states to 18925 states and 28254 transitions. [2022-07-12 07:35:23,537 INFO L78 Accepts]: Start accepts. Automaton has 18925 states and 28254 transitions. Word has length 110 [2022-07-12 07:35:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:23,537 INFO L495 AbstractCegarLoop]: Abstraction has 18925 states and 28254 transitions. [2022-07-12 07:35:23,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18925 states and 28254 transitions. [2022-07-12 07:35:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 07:35:23,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:23,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:23,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 07:35:23,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2110822017, now seen corresponding path program 1 times [2022-07-12 07:35:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:23,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299704823] [2022-07-12 07:35:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:23,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299704823] [2022-07-12 07:35:23,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299704823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:23,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:23,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:23,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391771155] [2022-07-12 07:35:23,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:23,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:23,623 INFO L87 Difference]: Start difference. First operand 18925 states and 28254 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:25,215 INFO L93 Difference]: Finished difference Result 29923 states and 44851 transitions. [2022-07-12 07:35:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2022-07-12 07:35:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:25,239 INFO L225 Difference]: With dead ends: 29923 [2022-07-12 07:35:25,239 INFO L226 Difference]: Without dead ends: 15895 [2022-07-12 07:35:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:25,257 INFO L413 NwaCegarLoop]: 386 mSDtfsCounter, 53 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:25,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15895 states. [2022-07-12 07:35:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15895 to 15895. [2022-07-12 07:35:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15895 states, 15894 states have (on average 1.4882345539197182) internal successors, (23654), 15894 states have internal predecessors, (23654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15895 states to 15895 states and 23654 transitions. [2022-07-12 07:35:26,893 INFO L78 Accepts]: Start accepts. Automaton has 15895 states and 23654 transitions. Word has length 112 [2022-07-12 07:35:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:26,893 INFO L495 AbstractCegarLoop]: Abstraction has 15895 states and 23654 transitions. [2022-07-12 07:35:26,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 15895 states and 23654 transitions. [2022-07-12 07:35:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 07:35:26,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:26,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:26,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 07:35:26,898 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2111608284, now seen corresponding path program 1 times [2022-07-12 07:35:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:26,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823933699] [2022-07-12 07:35:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823933699] [2022-07-12 07:35:26,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823933699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:26,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:26,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915309903] [2022-07-12 07:35:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:26,973 INFO L87 Difference]: Start difference. First operand 15895 states and 23654 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:28,359 INFO L93 Difference]: Finished difference Result 27467 states and 40894 transitions. [2022-07-12 07:35:28,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:28,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2022-07-12 07:35:28,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:28,373 INFO L225 Difference]: With dead ends: 27467 [2022-07-12 07:35:28,373 INFO L226 Difference]: Without dead ends: 11642 [2022-07-12 07:35:28,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:28,383 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 43 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:28,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1060 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11642 states. [2022-07-12 07:35:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11642 to 11642. [2022-07-12 07:35:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11642 states, 11641 states have (on average 1.4883601065200585) internal successors, (17326), 11641 states have internal predecessors, (17326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11642 states to 11642 states and 17326 transitions. [2022-07-12 07:35:29,561 INFO L78 Accepts]: Start accepts. Automaton has 11642 states and 17326 transitions. Word has length 115 [2022-07-12 07:35:29,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:29,561 INFO L495 AbstractCegarLoop]: Abstraction has 11642 states and 17326 transitions. [2022-07-12 07:35:29,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:29,561 INFO L276 IsEmpty]: Start isEmpty. Operand 11642 states and 17326 transitions. [2022-07-12 07:35:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 07:35:29,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:29,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:29,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 07:35:29,564 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash -993915098, now seen corresponding path program 1 times [2022-07-12 07:35:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:29,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778129899] [2022-07-12 07:35:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:29,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778129899] [2022-07-12 07:35:29,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778129899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:29,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:29,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:29,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46751946] [2022-07-12 07:35:29,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:29,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:35:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:35:29,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 07:35:29,615 INFO L87 Difference]: Start difference. First operand 11642 states and 17326 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:30,778 INFO L93 Difference]: Finished difference Result 20313 states and 30222 transitions. [2022-07-12 07:35:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-07-12 07:35:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:30,793 INFO L225 Difference]: With dead ends: 20313 [2022-07-12 07:35:30,794 INFO L226 Difference]: Without dead ends: 11632 [2022-07-12 07:35:30,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07-12 07:35:30,802 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 23 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:30,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1042 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11632 states. [2022-07-12 07:35:32,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11632 to 11632. [2022-07-12 07:35:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11632 states, 11631 states have (on average 1.4883500988736995) internal successors, (17311), 11631 states have internal predecessors, (17311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11632 states to 11632 states and 17311 transitions. [2022-07-12 07:35:32,028 INFO L78 Accepts]: Start accepts. Automaton has 11632 states and 17311 transitions. Word has length 120 [2022-07-12 07:35:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:32,028 INFO L495 AbstractCegarLoop]: Abstraction has 11632 states and 17311 transitions. [2022-07-12 07:35:32,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 11632 states and 17311 transitions. [2022-07-12 07:35:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 07:35:32,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:32,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:32,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 07:35:32,031 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1394285578, now seen corresponding path program 1 times [2022-07-12 07:35:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:32,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384986162] [2022-07-12 07:35:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:32,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384986162] [2022-07-12 07:35:32,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384986162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:32,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:32,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 07:35:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969367282] [2022-07-12 07:35:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:32,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:32,122 INFO L87 Difference]: Start difference. First operand 11632 states and 17311 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:33,317 INFO L93 Difference]: Finished difference Result 22352 states and 33242 transitions. [2022-07-12 07:35:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2022-07-12 07:35:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:33,332 INFO L225 Difference]: With dead ends: 22352 [2022-07-12 07:35:33,332 INFO L226 Difference]: Without dead ends: 10976 [2022-07-12 07:35:33,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:33,343 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 882 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:33,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 827 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:35:33,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10976 states. [2022-07-12 07:35:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10976 to 10819. [2022-07-12 07:35:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 10818 states have (on average 1.4815122943242744) internal successors, (16027), 10818 states have internal predecessors, (16027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 16027 transitions. [2022-07-12 07:35:34,544 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 16027 transitions. Word has length 120 [2022-07-12 07:35:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:34,544 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 16027 transitions. [2022-07-12 07:35:34,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 16027 transitions. [2022-07-12 07:35:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:35:34,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:34,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:34,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 07:35:34,548 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:34,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1343086903, now seen corresponding path program 1 times [2022-07-12 07:35:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:34,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939940384] [2022-07-12 07:35:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939940384] [2022-07-12 07:35:34,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939940384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:34,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:34,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362184514] [2022-07-12 07:35:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:34,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:34,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:34,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:34,602 INFO L87 Difference]: Start difference. First operand 10819 states and 16027 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:35,853 INFO L93 Difference]: Finished difference Result 20408 states and 30668 transitions. [2022-07-12 07:35:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:35:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-12 07:35:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:35,866 INFO L225 Difference]: With dead ends: 20408 [2022-07-12 07:35:35,867 INFO L226 Difference]: Without dead ends: 10819 [2022-07-12 07:35:35,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:35:35,877 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 840 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:35,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 350 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:35:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-07-12 07:35:37,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10819. [2022-07-12 07:35:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 10818 states have (on average 1.4694952856350527) internal successors, (15897), 10818 states have internal predecessors, (15897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 15897 transitions. [2022-07-12 07:35:37,145 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 15897 transitions. Word has length 122 [2022-07-12 07:35:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:37,145 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 15897 transitions. [2022-07-12 07:35:37,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 15897 transitions. [2022-07-12 07:35:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:35:37,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:37,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:37,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 07:35:37,148 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:37,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1090994532, now seen corresponding path program 1 times [2022-07-12 07:35:37,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:37,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763052531] [2022-07-12 07:35:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:37,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:37,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-07-12 07:35:37,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:37,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763052531] [2022-07-12 07:35:37,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763052531] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:37,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:37,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 07:35:37,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402876319] [2022-07-12 07:35:37,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:37,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:37,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:37,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:37,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:37,209 INFO L87 Difference]: Start difference. First operand 10819 states and 15897 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:38,573 INFO L93 Difference]: Finished difference Result 20628 states and 30690 transitions. [2022-07-12 07:35:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:35:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-12 07:35:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:38,587 INFO L225 Difference]: With dead ends: 20628 [2022-07-12 07:35:38,587 INFO L226 Difference]: Without dead ends: 10819 [2022-07-12 07:35:38,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:35:38,597 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 838 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:38,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 348 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:35:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2022-07-12 07:35:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10819. [2022-07-12 07:35:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10819 states, 10818 states have (on average 1.457478276945831) internal successors, (15767), 10818 states have internal predecessors, (15767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:39,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 15767 transitions. [2022-07-12 07:35:39,827 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 15767 transitions. Word has length 122 [2022-07-12 07:35:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:39,828 INFO L495 AbstractCegarLoop]: Abstraction has 10819 states and 15767 transitions. [2022-07-12 07:35:39,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 15767 transitions. [2022-07-12 07:35:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:35:39,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:39,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 07:35:39,831 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1423224191, now seen corresponding path program 1 times [2022-07-12 07:35:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593298874] [2022-07-12 07:35:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593298874] [2022-07-12 07:35:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593298874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:39,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:39,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 07:35:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571576613] [2022-07-12 07:35:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:39,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 07:35:39,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:39,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 07:35:39,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 07:35:39,927 INFO L87 Difference]: Start difference. First operand 10819 states and 15767 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:42,442 INFO L93 Difference]: Finished difference Result 29158 states and 43675 transitions. [2022-07-12 07:35:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:35:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-12 07:35:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:42,472 INFO L225 Difference]: With dead ends: 29158 [2022-07-12 07:35:42,472 INFO L226 Difference]: Without dead ends: 20026 [2022-07-12 07:35:42,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 07:35:42,480 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 743 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:42,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 859 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:35:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20026 states. [2022-07-12 07:35:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20026 to 20024. [2022-07-12 07:35:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20024 states, 20023 states have (on average 1.4824451880337612) internal successors, (29683), 20023 states have internal predecessors, (29683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20024 states to 20024 states and 29683 transitions. [2022-07-12 07:35:45,008 INFO L78 Accepts]: Start accepts. Automaton has 20024 states and 29683 transitions. Word has length 122 [2022-07-12 07:35:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:45,008 INFO L495 AbstractCegarLoop]: Abstraction has 20024 states and 29683 transitions. [2022-07-12 07:35:45,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20024 states and 29683 transitions. [2022-07-12 07:35:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:35:45,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:45,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:45,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 07:35:45,012 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 249575419, now seen corresponding path program 1 times [2022-07-12 07:35:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:45,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156322155] [2022-07-12 07:35:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:45,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:45,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156322155] [2022-07-12 07:35:45,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156322155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:45,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:45,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 07:35:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991268758] [2022-07-12 07:35:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 07:35:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 07:35:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 07:35:45,082 INFO L87 Difference]: Start difference. First operand 20024 states and 29683 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:35:50,052 INFO L93 Difference]: Finished difference Result 54720 states and 82953 transitions. [2022-07-12 07:35:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:35:50,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-12 07:35:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:35:50,119 INFO L225 Difference]: With dead ends: 54720 [2022-07-12 07:35:50,119 INFO L226 Difference]: Without dead ends: 37372 [2022-07-12 07:35:50,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:35:50,140 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 350 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:35:50,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1103 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 07:35:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37372 states. [2022-07-12 07:35:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37372 to 37370. [2022-07-12 07:35:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37370 states, 37369 states have (on average 1.4834488479755947) internal successors, (55435), 37369 states have internal predecessors, (55435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37370 states to 37370 states and 55435 transitions. [2022-07-12 07:35:55,404 INFO L78 Accepts]: Start accepts. Automaton has 37370 states and 55435 transitions. Word has length 122 [2022-07-12 07:35:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:35:55,404 INFO L495 AbstractCegarLoop]: Abstraction has 37370 states and 55435 transitions. [2022-07-12 07:35:55,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:35:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 37370 states and 55435 transitions. [2022-07-12 07:35:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:35:55,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:35:55,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:35:55,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 07:35:55,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:35:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:35:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1986267249, now seen corresponding path program 1 times [2022-07-12 07:35:55,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:35:55,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709590389] [2022-07-12 07:35:55,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:35:55,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:35:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:35:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 07:35:55,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:35:55,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709590389] [2022-07-12 07:35:55,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709590389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:35:55,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:35:55,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-12 07:35:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032901025] [2022-07-12 07:35:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:35:55,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 07:35:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:35:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 07:35:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2022-07-12 07:35:55,966 INFO L87 Difference]: Start difference. First operand 37370 states and 55435 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:36:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:36:27,929 INFO L93 Difference]: Finished difference Result 185757 states and 278197 transitions. [2022-07-12 07:36:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 07:36:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-12 07:36:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:36:28,283 INFO L225 Difference]: With dead ends: 185757 [2022-07-12 07:36:28,284 INFO L226 Difference]: Without dead ends: 170003 [2022-07-12 07:36:28,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 07:36:28,338 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 2863 mSDsluCounter, 8475 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 9190 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 07:36:28,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 9190 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 07:36:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170003 states. [2022-07-12 07:36:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170003 to 38074. [2022-07-12 07:36:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38074 states, 38073 states have (on average 1.477897722795682) internal successors, (56268), 38073 states have internal predecessors, (56268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:36:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38074 states to 38074 states and 56268 transitions. [2022-07-12 07:36:38,566 INFO L78 Accepts]: Start accepts. Automaton has 38074 states and 56268 transitions. Word has length 122 [2022-07-12 07:36:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:36:38,566 INFO L495 AbstractCegarLoop]: Abstraction has 38074 states and 56268 transitions. [2022-07-12 07:36:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 07:36:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 38074 states and 56268 transitions. [2022-07-12 07:36:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 07:36:38,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:36:38,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:36:38,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 07:36:38,571 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:36:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:36:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash -270948014, now seen corresponding path program 1 times [2022-07-12 07:36:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:36:38,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450927465] [2022-07-12 07:36:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:36:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:36:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 07:36:38,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 07:36:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 07:36:38,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 07:36:38,699 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 07:36:38,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 07:36:38,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 07:36:38,705 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-12 07:36:38,708 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 07:36:38,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:36:38 BoogieIcfgContainer [2022-07-12 07:36:38,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 07:36:38,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 07:36:38,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 07:36:38,842 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 07:36:38,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:35:06" (3/4) ... [2022-07-12 07:36:38,844 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 07:36:38,964 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 07:36:38,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 07:36:38,965 INFO L158 Benchmark]: Toolchain (without parser) took 93540.03ms. Allocated memory was 98.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 66.8MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 507.4MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,965 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 07:36:38,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.19ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 66.6MB in the beginning and 102.5MB in the end (delta: -35.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.37ms. Allocated memory is still 138.4MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,969 INFO L158 Benchmark]: Boogie Preprocessor took 30.13ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 95.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,969 INFO L158 Benchmark]: RCFGBuilder took 769.20ms. Allocated memory is still 138.4MB. Free memory was 95.8MB in the beginning and 75.5MB in the end (delta: 20.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,969 INFO L158 Benchmark]: TraceAbstraction took 92174.90ms. Allocated memory was 138.4MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 75.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 442.4MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,970 INFO L158 Benchmark]: Witness Printer took 123.27ms. Allocated memory is still 7.3GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 07:36:38,977 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.19ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 66.6MB in the beginning and 102.5MB in the end (delta: -35.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.37ms. Allocated memory is still 138.4MB. Free memory was 102.5MB in the beginning and 98.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.13ms. Allocated memory is still 138.4MB. Free memory was 98.8MB in the beginning and 95.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 769.20ms. Allocated memory is still 138.4MB. Free memory was 95.8MB in the beginning and 75.5MB in the end (delta: 20.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 92174.90ms. Allocated memory was 138.4MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 75.5MB in the beginning and 6.8GB in the end (delta: -6.7GB). Peak memory consumption was 442.4MB. Max. memory is 16.1GB. * Witness Printer took 123.27ms. Allocated memory is still 7.3GB. Free memory was 6.8GB in the beginning and 6.8GB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 595]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L26] msg_t nomsg = (msg_t )-1; [L27] port_t p12 = 0; [L28] char p12_old = '\x0'; [L29] char p12_new = '\x0'; [L30] _Bool ep12 = 0; [L31] port_t p13 = 0; [L32] char p13_old = '\x0'; [L33] char p13_new = '\x0'; [L34] _Bool ep13 = 0; [L35] port_t p21 = 0; [L36] char p21_old = '\x0'; [L37] char p21_new = '\x0'; [L38] _Bool ep21 = 0; [L39] port_t p23 = 0; [L40] char p23_old = '\x0'; [L41] char p23_new = '\x0'; [L42] _Bool ep23 = 0; [L43] port_t p31 = 0; [L44] char p31_old = '\x0'; [L45] char p31_new = '\x0'; [L46] _Bool ep31 = 0; [L47] port_t p32 = 0; [L48] char p32_old = '\x0'; [L49] char p32_new = '\x0'; [L50] _Bool ep32 = 0; [L51] char id1 = '\x0'; [L52] unsigned char r1 = '\x0'; [L53] char st1 = '\x0'; [L54] char nl1 = '\x0'; [L55] char m1 = '\x0'; [L56] char max1 = '\x0'; [L57] _Bool mode1 = 0; [L58] _Bool newmax1 = 0; [L59] char id2 = '\x0'; [L60] unsigned char r2 = '\x0'; [L61] char st2 = '\x0'; [L62] char nl2 = '\x0'; [L63] char m2 = '\x0'; [L64] char max2 = '\x0'; [L65] _Bool mode2 = 0; [L66] _Bool newmax2 = 0; [L67] char id3 = '\x0'; [L68] unsigned char r3 = '\x0'; [L69] char st3 = '\x0'; [L70] char nl3 = '\x0'; [L71] char m3 = '\x0'; [L72] char max3 = '\x0'; [L73] _Bool mode3 = 0; [L74] _Bool newmax3 = 0; [L78] void (*nodes[3])() = { &node1, &node2, &node3 }; [L82] int __return_1248; [L83] int __return_1394; [L84] int __return_1528; [L85] int __return_1653; VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=0, id3=0, m1=0, m2=0, m3=0, max1=0, max2=0, max3=0, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L88] int main__c1; [L89] int main__i2; [L90] main__c1 = 0 [L91] ep12 = __VERIFIER_nondet_bool() [L92] ep13 = __VERIFIER_nondet_bool() [L93] ep21 = __VERIFIER_nondet_bool() [L94] ep23 = __VERIFIER_nondet_bool() [L95] ep31 = __VERIFIER_nondet_bool() [L96] ep32 = __VERIFIER_nondet_bool() [L97] id1 = __VERIFIER_nondet_char() [L98] r1 = __VERIFIER_nondet_uchar() [L99] st1 = __VERIFIER_nondet_char() [L100] nl1 = __VERIFIER_nondet_char() [L101] m1 = __VERIFIER_nondet_char() [L102] max1 = __VERIFIER_nondet_char() [L103] mode1 = __VERIFIER_nondet_bool() [L104] newmax1 = __VERIFIER_nondet_bool() [L105] id2 = __VERIFIER_nondet_char() [L106] r2 = __VERIFIER_nondet_uchar() [L107] st2 = __VERIFIER_nondet_char() [L108] nl2 = __VERIFIER_nondet_char() [L109] m2 = __VERIFIER_nondet_char() [L110] max2 = __VERIFIER_nondet_char() [L111] mode2 = __VERIFIER_nondet_bool() [L112] newmax2 = __VERIFIER_nondet_bool() [L113] id3 = __VERIFIER_nondet_char() [L114] r3 = __VERIFIER_nondet_uchar() [L115] st3 = __VERIFIER_nondet_char() [L116] nl3 = __VERIFIER_nondet_char() [L117] m3 = __VERIFIER_nondet_char() [L118] max3 = __VERIFIER_nondet_char() [L119] mode3 = __VERIFIER_nondet_bool() [L120] newmax3 = __VERIFIER_nondet_bool() [L122] _Bool init__r121; [L123] _Bool init__r131; [L124] _Bool init__r211; [L125] _Bool init__r231; [L126] _Bool init__r311; [L127] _Bool init__r321; [L128] _Bool init__r122; [L129] int init__tmp; [L130] _Bool init__r132; [L131] int init__tmp___0; [L132] _Bool init__r212; [L133] int init__tmp___1; [L134] _Bool init__r232; [L135] int init__tmp___2; [L136] _Bool init__r312; [L137] int init__tmp___3; [L138] _Bool init__r322; [L139] int init__tmp___4; [L140] int init__tmp___5; [L141] init__r121 = ep12 [L142] init__r131 = ep13 [L143] init__r211 = ep21 [L144] init__r231 = ep23 [L145] init__r311 = ep31 [L146] init__r321 = ep32 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L147] COND TRUE !(init__r121 == 0) [L149] init__tmp = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L151] init__r122 = (_Bool)init__tmp VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L152] COND FALSE !(!(init__r131 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1773] COND TRUE !(init__r121 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1775] COND TRUE !(ep23 == 0) [L1777] init__tmp___0 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L156] init__r132 = (_Bool)init__tmp___0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L157] COND FALSE !(!(init__r211 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1750] COND TRUE !(init__r231 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1752] COND TRUE !(ep31 == 0) [L1754] init__tmp___1 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L161] init__r212 = (_Bool)init__tmp___1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L162] COND TRUE !(init__r231 == 0) [L164] init__tmp___2 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L166] init__r232 = (_Bool)init__tmp___2 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L167] COND TRUE !(init__r311 == 0) [L169] init__tmp___3 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L171] init__r312 = (_Bool)init__tmp___3 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L172] COND FALSE !(!(init__r321 == 0)) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1681] COND TRUE !(init__r311 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L1683] COND TRUE !(ep12 == 0) [L1685] init__tmp___4 = 1 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L176] init__r322 = (_Bool)init__tmp___4 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)id1) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L185] COND TRUE ((int)id2) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)id3) >= 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)r1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, st1=0, st2=0, st3=0] [L191] COND TRUE ((int)r2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, st1=0, st2=0, st3=0] [L193] COND TRUE ((int)r3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r122 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE !(init__r132 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE !(init__r212 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE !(init__r232 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE !(init__r312 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE !(init__r322 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)st1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)st2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)st3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)nl2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)nl3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode1) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, mode1=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L227] COND TRUE ((int)mode2) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L229] COND TRUE ((int)mode3) == 0 VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L231] COND TRUE !(newmax1 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L233] COND TRUE !(newmax2 == 0) VAL [__return_1248=0, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, m1=0, m2=0, m3=0, main__c1=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L235] COND TRUE !(newmax3 == 0) [L237] init__tmp___5 = 1 [L238] __return_1248 = init__tmp___5 [L239] main__i2 = __return_1248 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=1, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L240] COND TRUE main__i2 != 0 [L242] p12_old = nomsg [L243] p12_new = nomsg [L244] p13_old = nomsg [L245] p13_new = nomsg [L246] p21_old = nomsg [L247] p21_new = nomsg [L248] p23_old = nomsg [L249] p23_new = nomsg [L250] p31_old = nomsg [L251] p31_new = nomsg [L252] p32_old = nomsg [L253] p32_new = nomsg [L254] main__i2 = 0 [L256] _Bool node1__newmax; [L257] node1__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L258] COND FALSE !(!(mode1 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L264] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L266] COND TRUE !(ep12 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L268] COND TRUE !(newmax1 == 0) [L270] int node1____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L271] COND TRUE max1 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L273] COND TRUE p12_new == nomsg [L275] node1____CPAchecker_TMP_0 = max1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L277] p12_new = node1____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L279] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L292] mode1 = 1 [L294] _Bool node2__newmax; [L295] node2__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L296] COND FALSE !(!(mode2 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L302] COND TRUE ((int)r2) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L304] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L317] COND TRUE !(ep23 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L319] COND TRUE !(newmax2 == 0) [L321] int node2____CPAchecker_TMP_1; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L322] COND TRUE max2 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L324] COND TRUE p23_new == nomsg [L326] node2____CPAchecker_TMP_1 = max2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L328] p23_new = node2____CPAchecker_TMP_1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L330] mode2 = 1 [L332] _Bool node3__newmax; [L333] node3__newmax = 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L334] COND FALSE !(!(mode3 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] COND TRUE ((int)r3) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] COND TRUE !(ep31 == 0) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L344] COND TRUE !(newmax3 == 0) [L346] int node3____CPAchecker_TMP_0; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L347] COND TRUE max3 != nomsg VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L349] COND TRUE p31_new == nomsg [L351] node3____CPAchecker_TMP_0 = max3 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L353] p31_new = node3____CPAchecker_TMP_0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L355] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=4, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=127, p23_old=-1, p31=0, p31_new=0, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L368] mode3 = 1 [L369] p12_old = p12_new [L370] p12_new = nomsg [L371] p13_old = p13_new [L372] p13_new = nomsg [L373] p21_old = p21_new [L374] p21_new = nomsg [L375] p23_old = p23_new [L376] p23_new = nomsg [L377] p31_old = p31_new [L378] p31_new = nomsg [L379] p32_old = p32_new [L380] p32_new = nomsg [L382] int check__tmp; VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L385] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L387] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L389] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L391] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L397] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L399] COND TRUE ((int)r1) < 2 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1248=1, __return_1394=0, __return_1528=0, __return_1653=0, __return_main=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=0, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L409] COND TRUE ((int)r1) < 2 [L411] check__tmp = 1 [L412] __return_1394 = check__tmp [L413] main__c1 = __return_1394 [L415] _Bool __tmp_1; [L416] __tmp_1 = main__c1 [L417] _Bool assert__arg; [L418] assert__arg = __tmp_1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND FALSE !(assert__arg == 0) [L426] _Bool node1__newmax; [L427] node1__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L428] COND TRUE !(mode1 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L430] COND FALSE !(r1 == 255) [L436] r1 = r1 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND FALSE !(!(ep21 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=0, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L446] COND TRUE !(ep31 == 0) [L448] m1 = p31_old [L449] p31_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] newmax1 = node1__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE ((int)r1) == 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int)max1) == ((int)id1) [L460] st1 = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L462] mode1 = 0 [L464] _Bool node2__newmax; [L465] node2__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L466] COND TRUE !(mode2 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L468] COND FALSE !(r2 == 255) [L474] r2 = r2 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=0, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=4, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L475] COND TRUE !(ep12 == 0) [L477] m2 = p12_old [L478] p12_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L479] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L484] COND FALSE !(!(ep32 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L493] newmax2 = node2__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L494] COND FALSE !(((int)r2) == 2) [L500] mode2 = 0 [L502] _Bool node3__newmax; [L503] node3__newmax = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L504] COND TRUE !(mode3 == 0) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L506] COND FALSE !(r3 == 255) [L512] r3 = r3 + 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L513] COND FALSE !(!(ep13 == 0)) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=0, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L522] COND TRUE !(ep23 == 0) [L524] m3 = p23_old [L525] p23_old = nomsg VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=0, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L526] COND TRUE ((int)m3) > ((int)max3) [L528] max3 = m3 [L529] node3__newmax = 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L531] newmax3 = node3__newmax VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L532] COND FALSE !(((int)r3) == 2) [L538] mode3 = 0 [L539] p12_old = p12_new [L540] p12_new = nomsg [L541] p13_old = p13_new [L542] p13_new = nomsg [L543] p21_old = p21_new [L544] p21_new = nomsg [L545] p23_old = p23_new [L546] p23_new = nomsg [L547] p31_old = p31_new [L548] p31_new = nomsg [L549] p32_old = p32_new [L550] p32_new = nomsg [L552] int check__tmp; VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L553] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L555] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L557] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L559] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L561] COND FALSE !(((int)r1) >= 2) VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L567] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L1206] check__tmp = 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=1, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L585] __return_1528 = check__tmp [L586] main__c1 = __return_1528 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, assert__arg=1, check__tmp=0, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=0, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=0, node3__newmax=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L589] _Bool __tmp_2; [L590] __tmp_2 = main__c1 [L591] _Bool assert__arg; [L592] assert__arg = __tmp_2 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=0, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L593] COND TRUE assert__arg == 0 VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=1, check__tmp=0, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=0, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L595] reach_error() VAL [__return_1248=1, __return_1394=1, __return_1528=0, __return_1653=0, __return_main=0, __tmp_1=1, __tmp_2=0, assert__arg=0, assert__arg=1, check__tmp=0, check__tmp=1, ep12=1, ep13=0, ep21=0, ep23=1, ep31=1, ep32=0, id1=4, id2=127, id3=0, init__r121=1, init__r122=1, init__r131=0, init__r132=1, init__r211=0, init__r212=1, init__r231=1, init__r232=1, init__r311=1, init__r312=1, init__r321=0, init__r322=1, init__tmp=1, init__tmp___0=1, init__tmp___1=1, init__tmp___2=1, init__tmp___3=1, init__tmp___4=1, init__tmp___5=1, m1=0, m2=4, m3=127, main__c1=0, main__i2=0, max1=4, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_0=4, node1__newmax=0, node1__newmax=0, node2____CPAchecker_TMP_1=127, node2__newmax=0, node2__newmax=0, node3____CPAchecker_TMP_0=0, node3__newmax=1, node3__newmax=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 247 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 92.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13692 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13692 mSDsluCounter, 29006 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17344 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 11662 mSDtfsCounter, 3188 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38074occurred in iteration=24, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 139985 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2781 NumberOfCodeBlocks, 2781 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2635 ConstructedInterpolants, 0 QuantifiedInterpolants, 11978 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 07:36:39,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE