./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68d161eb03bccd8280d2086bc4cdb7b46f7ee157 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-30 17:42:23,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-30 17:42:23,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-30 17:42:23,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-30 17:42:23,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-30 17:42:23,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-30 17:42:23,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-30 17:42:23,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-30 17:42:23,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-30 17:42:23,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-30 17:42:23,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-30 17:42:23,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-30 17:42:23,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-30 17:42:23,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-30 17:42:23,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-30 17:42:23,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-30 17:42:23,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-30 17:42:23,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-30 17:42:23,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-30 17:42:23,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-30 17:42:23,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-30 17:42:23,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-30 17:42:23,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-30 17:42:23,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-30 17:42:23,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-30 17:42:23,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-30 17:42:23,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-30 17:42:23,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-30 17:42:23,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-30 17:42:23,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-30 17:42:23,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-30 17:42:23,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-30 17:42:23,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-30 17:42:23,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-30 17:42:23,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-30 17:42:23,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-30 17:42:23,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-30 17:42:23,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-30 17:42:23,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-30 17:42:23,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-30 17:42:23,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-30 17:42:23,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-30 17:42:23,621 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-30 17:42:23,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-30 17:42:23,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-30 17:42:23,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-30 17:42:23,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-30 17:42:23,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-30 17:42:23,624 INFO L138 SettingsManager]: * Use SBE=true [2021-08-30 17:42:23,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-30 17:42:23,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-30 17:42:23,624 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-30 17:42:23,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-30 17:42:23,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-30 17:42:23,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-30 17:42:23,625 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-30 17:42:23,626 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-30 17:42:23,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-30 17:42:23,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-30 17:42:23,631 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-30 17:42:23,631 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-30 17:42:23,631 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-30 17:42:23,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-30 17:42:23,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:42:23,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-30 17:42:23,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-30 17:42:23,633 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 68d161eb03bccd8280d2086bc4cdb7b46f7ee157 [2021-08-30 17:42:23,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-30 17:42:23,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-30 17:42:23,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-30 17:42:23,914 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-30 17:42:23,915 INFO L275 PluginConnector]: CDTParser initialized [2021-08-30 17:42:23,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-08-30 17:42:23,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a18c572b/1a35e9fb386f4daeb77f33a4c9303b7b/FLAG2994dc5b1 [2021-08-30 17:42:24,305 INFO L306 CDTParser]: Found 1 translation units. [2021-08-30 17:42:24,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_-write.c [2021-08-30 17:42:24,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a18c572b/1a35e9fb386f4daeb77f33a4c9303b7b/FLAG2994dc5b1 [2021-08-30 17:42:24,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a18c572b/1a35e9fb386f4daeb77f33a4c9303b7b [2021-08-30 17:42:24,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-30 17:42:24,329 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-30 17:42:24,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-30 17:42:24,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-30 17:42:24,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-30 17:42:24,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403872cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24, skipping insertion in model container [2021-08-30 17:42:24,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-30 17:42:24,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-30 17:42:24,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:42:24,471 INFO L203 MainTranslator]: Completed pre-run [2021-08-30 17:42:24,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-30 17:42:24,496 INFO L208 MainTranslator]: Completed translation [2021-08-30 17:42:24,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24 WrapperNode [2021-08-30 17:42:24,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-30 17:42:24,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-30 17:42:24,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-30 17:42:24,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-30 17:42:24,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-30 17:42:24,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-30 17:42:24,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-30 17:42:24,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-30 17:42:24,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (1/1) ... [2021-08-30 17:42:24,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-30 17:42:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:24,590 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) [2021-08-30 17:42:24,612 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 [2021-08-30 17:42:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-30 17:42:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-30 17:42:24,630 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-08-30 17:42:24,630 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-30 17:42:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-08-30 17:42:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-30 17:42:24,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-30 17:42:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-30 17:42:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-30 17:42:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-30 17:42:24,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-30 17:42:24,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-30 17:42:24,773 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-30 17:42:24,773 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-08-30 17:42:24,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:42:24 BoogieIcfgContainer [2021-08-30 17:42:24,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-30 17:42:24,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-30 17:42:24,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-30 17:42:24,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-30 17:42:24,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:42:24" (1/3) ... [2021-08-30 17:42:24,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5480940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:42:24, skipping insertion in model container [2021-08-30 17:42:24,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:42:24" (2/3) ... [2021-08-30 17:42:24,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5480940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:42:24, skipping insertion in model container [2021-08-30 17:42:24,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:42:24" (3/3) ... [2021-08-30 17:42:24,794 INFO L111 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_-write.c [2021-08-30 17:42:24,801 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-30 17:42:24,801 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2021-08-30 17:42:24,838 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-30 17:42:24,844 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-30 17:42:24,844 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-08-30 17:42:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-30 17:42:24,862 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:24,862 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:24,863 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2021-08-30 17:42:24,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:24,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645572612] [2021-08-30 17:42:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:24,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:25,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645572612] [2021-08-30 17:42:25,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645572612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:25,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:25,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:42:25,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442178221] [2021-08-30 17:42:25,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:42:25,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:25,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:42:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:42:25,091 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:25,274 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2021-08-30 17:42:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:42:25,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-08-30 17:42:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:25,281 INFO L225 Difference]: With dead ends: 58 [2021-08-30 17:42:25,281 INFO L226 Difference]: Without dead ends: 54 [2021-08-30 17:42:25,282 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.68ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:42:25,284 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 153.00ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:25,285 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 153.00ms Time] [2021-08-30 17:42:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-08-30 17:42:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2021-08-30 17:42:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-08-30 17:42:25,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2021-08-30 17:42:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:25,311 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-08-30 17:42:25,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-08-30 17:42:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-30 17:42:25,312 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:25,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:25,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-30 17:42:25,313 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2021-08-30 17:42:25,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:25,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604565865] [2021-08-30 17:42:25,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:25,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:25,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604565865] [2021-08-30 17:42:25,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604565865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:25,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:25,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-30 17:42:25,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775748116] [2021-08-30 17:42:25,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:42:25,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:42:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-30 17:42:25,350 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:25,415 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-08-30 17:42:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:42:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-08-30 17:42:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:25,418 INFO L225 Difference]: With dead ends: 49 [2021-08-30 17:42:25,418 INFO L226 Difference]: Without dead ends: 49 [2021-08-30 17:42:25,418 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.26ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:42:25,419 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.77ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:25,419 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 11 Invalid, 96 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 52.77ms Time] [2021-08-30 17:42:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-08-30 17:42:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2021-08-30 17:42:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-08-30 17:42:25,424 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2021-08-30 17:42:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:25,424 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-30 17:42:25,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,426 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2021-08-30 17:42:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:42:25,430 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:25,430 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:25,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-30 17:42:25,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2021-08-30 17:42:25,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:25,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57076266] [2021-08-30 17:42:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:25,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:25,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57076266] [2021-08-30 17:42:25,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57076266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:25,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:25,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:42:25,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934306236] [2021-08-30 17:42:25,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:42:25,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:42:25,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:42:25,525 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:25,632 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-08-30 17:42:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:42:25,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 17:42:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:25,633 INFO L225 Difference]: With dead ends: 40 [2021-08-30 17:42:25,633 INFO L226 Difference]: Without dead ends: 40 [2021-08-30 17:42:25,634 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.44ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:42:25,634 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.61ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.53ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:25,635 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 14 Invalid, 127 Unknown, 0 Unchecked, 1.61ms Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 80.53ms Time] [2021-08-30 17:42:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-30 17:42:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-08-30 17:42:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-08-30 17:42:25,638 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2021-08-30 17:42:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:25,638 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-08-30 17:42:25,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-08-30 17:42:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-30 17:42:25,639 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:25,639 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:25,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-30 17:42:25,639 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2021-08-30 17:42:25,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:25,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514497565] [2021-08-30 17:42:25,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:25,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:25,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514497565] [2021-08-30 17:42:25,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514497565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:25,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:25,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-30 17:42:25,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807341770] [2021-08-30 17:42:25,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:42:25,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:25,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:42:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:42:25,719 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:25,822 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-08-30 17:42:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:42:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-30 17:42:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:25,824 INFO L225 Difference]: With dead ends: 46 [2021-08-30 17:42:25,824 INFO L226 Difference]: Without dead ends: 46 [2021-08-30 17:42:25,824 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.66ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:42:25,830 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.80ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.24ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:25,833 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 139 Unknown, 0 Unchecked, 3.80ms Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 74.24ms Time] [2021-08-30 17:42:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-30 17:42:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2021-08-30 17:42:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2021-08-30 17:42:25,855 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2021-08-30 17:42:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:25,855 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2021-08-30 17:42:25,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2021-08-30 17:42:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-30 17:42:25,861 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:25,861 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:25,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-30 17:42:25,862 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2021-08-30 17:42:25,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:25,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144895463] [2021-08-30 17:42:25,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:25,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:25,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:25,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144895463] [2021-08-30 17:42:25,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144895463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:25,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:25,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 17:42:25,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286956184] [2021-08-30 17:42:25,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:42:25,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:42:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:42:25,933 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:26,056 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-08-30 17:42:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:42:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2021-08-30 17:42:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:26,060 INFO L225 Difference]: With dead ends: 61 [2021-08-30 17:42:26,060 INFO L226 Difference]: Without dead ends: 61 [2021-08-30 17:42:26,061 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.78ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:42:26,065 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.82ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:26,067 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 169 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 86.82ms Time] [2021-08-30 17:42:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-08-30 17:42:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2021-08-30 17:42:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 39 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:42:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2021-08-30 17:42:26,073 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 15 [2021-08-30 17:42:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:26,073 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2021-08-30 17:42:26,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2021-08-30 17:42:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-30 17:42:26,075 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:26,075 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:26,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-30 17:42:26,075 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:26,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2021-08-30 17:42:26,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:26,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835033777] [2021-08-30 17:42:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:26,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:26,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:26,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835033777] [2021-08-30 17:42:26,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835033777] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:26,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034688976] [2021-08-30 17:42:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:26,130 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:26,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:26,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:26,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-30 17:42:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:26,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-30 17:42:26,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:26,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:26,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034688976] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:26,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:26,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2021-08-30 17:42:26,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74364965] [2021-08-30 17:42:26,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:42:26,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:26,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:42:26,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:42:26,378 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:26,535 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-08-30 17:42:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:26,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-30 17:42:26,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:26,538 INFO L225 Difference]: With dead ends: 70 [2021-08-30 17:42:26,538 INFO L226 Difference]: Without dead ends: 70 [2021-08-30 17:42:26,538 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 61.44ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-08-30 17:42:26,539 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 91.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.97ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.18ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:26,541 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 31 Invalid, 207 Unknown, 0 Unchecked, 1.97ms Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 108.18ms Time] [2021-08-30 17:42:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-08-30 17:42:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2021-08-30 17:42:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:42:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-08-30 17:42:26,559 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2021-08-30 17:42:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:26,559 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-08-30 17:42:26,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-08-30 17:42:26,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-30 17:42:26,561 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:26,561 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:26,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:26,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-30 17:42:26,775 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:26,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1213405753, now seen corresponding path program 1 times [2021-08-30 17:42:26,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:26,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969009851] [2021-08-30 17:42:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:26,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:26,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-30 17:42:26,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:26,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969009851] [2021-08-30 17:42:26,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969009851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:26,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:26,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-30 17:42:26,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955531276] [2021-08-30 17:42:26,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:42:26,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:42:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-30 17:42:26,863 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:26,982 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2021-08-30 17:42:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-30 17:42:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:26,983 INFO L225 Difference]: With dead ends: 58 [2021-08-30 17:42:26,983 INFO L226 Difference]: Without dead ends: 58 [2021-08-30 17:42:26,983 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.25ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:42:26,984 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.86ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:26,984 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 17 Invalid, 164 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 77.86ms Time] [2021-08-30 17:42:26,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-08-30 17:42:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-08-30 17:42:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-30 17:42:26,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-08-30 17:42:26,988 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 17 [2021-08-30 17:42:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:26,988 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-08-30 17:42:26,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-08-30 17:42:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-30 17:42:26,989 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:26,989 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:26,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-30 17:42:26,989 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2021-08-30 17:42:26,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:26,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945030779] [2021-08-30 17:42:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:26,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:27,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:27,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945030779] [2021-08-30 17:42:27,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945030779] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:27,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570149092] [2021-08-30 17:42:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:27,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:27,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:27,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:27,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-30 17:42:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-30 17:42:27,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:27,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:27,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:27,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570149092] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:27,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:27,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2021-08-30 17:42:27,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286553089] [2021-08-30 17:42:27,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-30 17:42:27,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-30 17:42:27,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-30 17:42:27,378 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:27,557 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2021-08-30 17:42:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-30 17:42:27,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2021-08-30 17:42:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:27,558 INFO L225 Difference]: With dead ends: 75 [2021-08-30 17:42:27,558 INFO L226 Difference]: Without dead ends: 69 [2021-08-30 17:42:27,558 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 112.20ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-08-30 17:42:27,558 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 123.31ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:27,559 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 36 Invalid, 281 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [16 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 123.31ms Time] [2021-08-30 17:42:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-30 17:42:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2021-08-30 17:42:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.255813953488372) internal successors, (54), 48 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-08-30 17:42:27,561 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 20 [2021-08-30 17:42:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:27,561 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-08-30 17:42:27,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-08-30 17:42:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-30 17:42:27,562 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:27,562 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:27,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:27,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-08-30 17:42:27,773 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -523456178, now seen corresponding path program 2 times [2021-08-30 17:42:27,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:27,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64348797] [2021-08-30 17:42:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:27,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-30 17:42:27,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:27,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64348797] [2021-08-30 17:42:27,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64348797] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:27,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004610221] [2021-08-30 17:42:27,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:27,838 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:27,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:27,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-30 17:42:27,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:42:27,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:27,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-30 17:42:27,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:27,914 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:42:27,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-08-30 17:42:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:28,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:28,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004610221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:28,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:28,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2021-08-30 17:42:28,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645967165] [2021-08-30 17:42:28,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-30 17:42:28,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:28,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-30 17:42:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:42:28,334 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:28,348 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2021-08-30 17:42:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:42:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-08-30 17:42:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:28,349 INFO L225 Difference]: With dead ends: 83 [2021-08-30 17:42:28,349 INFO L226 Difference]: Without dead ends: 83 [2021-08-30 17:42:28,349 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 48.94ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:42:28,349 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 11.32ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:28,349 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 54 Unknown, 0 Unchecked, 0.25ms Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 35 Unchecked, 11.32ms Time] [2021-08-30 17:42:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-08-30 17:42:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-08-30 17:42:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 75 states have internal predecessors, (86), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2021-08-30 17:42:28,353 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 25 [2021-08-30 17:42:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:28,353 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2021-08-30 17:42:28,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2021-08-30 17:42:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-30 17:42:28,354 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:28,354 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:28,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:28,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:28,569 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash -523456177, now seen corresponding path program 1 times [2021-08-30 17:42:28,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:28,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171704340] [2021-08-30 17:42:28,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:28,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:28,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:28,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171704340] [2021-08-30 17:42:28,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171704340] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:28,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-30 17:42:28,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-30 17:42:28,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727011510] [2021-08-30 17:42:28,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:42:28,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:28,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:42:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:42:28,624 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:28,666 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2021-08-30 17:42:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-30 17:42:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-08-30 17:42:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:28,667 INFO L225 Difference]: With dead ends: 85 [2021-08-30 17:42:28,667 INFO L226 Difference]: Without dead ends: 85 [2021-08-30 17:42:28,667 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.19ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-30 17:42:28,668 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.46ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:28,668 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 95 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 38.46ms Time] [2021-08-30 17:42:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-08-30 17:42:28,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2021-08-30 17:42:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 75 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2021-08-30 17:42:28,671 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 25 [2021-08-30 17:42:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:28,671 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2021-08-30 17:42:28,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2021-08-30 17:42:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:42:28,672 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:28,672 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:28,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-30 17:42:28,672 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr2REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2020089663, now seen corresponding path program 1 times [2021-08-30 17:42:28,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:28,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860320816] [2021-08-30 17:42:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:28,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:28,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:28,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860320816] [2021-08-30 17:42:28,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860320816] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:28,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633440414] [2021-08-30 17:42:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:28,701 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:28,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:28,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:28,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-30 17:42:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:28,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:42:28,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:28,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:28,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633440414] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:28,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:28,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-08-30 17:42:28,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639377119] [2021-08-30 17:42:28,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-30 17:42:28,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-30 17:42:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:42:28,794 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:42:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:28,818 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2021-08-30 17:42:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-30 17:42:28,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2021-08-30 17:42:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:28,819 INFO L225 Difference]: With dead ends: 81 [2021-08-30 17:42:28,819 INFO L226 Difference]: Without dead ends: 81 [2021-08-30 17:42:28,820 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 8.64ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-30 17:42:28,820 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.82ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:28,821 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.28ms Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 21.82ms Time] [2021-08-30 17:42:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-08-30 17:42:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-08-30 17:42:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 73 states have internal predecessors, (83), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-08-30 17:42:28,824 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 31 [2021-08-30 17:42:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:28,825 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-08-30 17:42:28,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:42:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-08-30 17:42:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:42:28,828 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:28,828 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:28,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:29,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:29,046 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:29,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2020089664, now seen corresponding path program 1 times [2021-08-30 17:42:29,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:29,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27785886] [2021-08-30 17:42:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:29,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:29,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:29,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27785886] [2021-08-30 17:42:29,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27785886] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:29,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744445062] [2021-08-30 17:42:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:29,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:29,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:29,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:29,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-30 17:42:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-30 17:42:29,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:29,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:29,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744445062] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:29,223 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:29,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-08-30 17:42:29,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210906938] [2021-08-30 17:42:29,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-30 17:42:29,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:29,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-30 17:42:29,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:42:29,224 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:29,317 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2021-08-30 17:42:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2021-08-30 17:42:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:29,318 INFO L225 Difference]: With dead ends: 124 [2021-08-30 17:42:29,318 INFO L226 Difference]: Without dead ends: 124 [2021-08-30 17:42:29,318 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.56ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-30 17:42:29,318 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.22ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:29,319 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 21 Invalid, 171 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [21 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 87.22ms Time] [2021-08-30 17:42:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-30 17:42:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2021-08-30 17:42:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 98 states have internal predecessors, (116), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 127 transitions. [2021-08-30 17:42:29,321 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 127 transitions. Word has length 31 [2021-08-30 17:42:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:29,321 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 127 transitions. [2021-08-30 17:42:29,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 127 transitions. [2021-08-30 17:42:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-30 17:42:29,322 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:29,322 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:29,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:29,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-08-30 17:42:29,537 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1856317080, now seen corresponding path program 2 times [2021-08-30 17:42:29,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:29,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666183766] [2021-08-30 17:42:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:29,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-30 17:42:29,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:29,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666183766] [2021-08-30 17:42:29,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666183766] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:29,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286452086] [2021-08-30 17:42:29,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:29,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:29,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:29,584 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:29,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-30 17:42:29,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:29,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-30 17:42:29,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-30 17:42:29,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:29,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286452086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:29,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:29,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2021-08-30 17:42:29,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487105649] [2021-08-30 17:42:29,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-30 17:42:29,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-30 17:42:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-30 17:42:29,719 INFO L87 Difference]: Start difference. First operand 108 states and 127 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:29,817 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2021-08-30 17:42:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-30 17:42:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:29,818 INFO L225 Difference]: With dead ends: 101 [2021-08-30 17:42:29,818 INFO L226 Difference]: Without dead ends: 101 [2021-08-30 17:42:29,818 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 61.08ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:42:29,819 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.91ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:29,819 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 207 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 77.91ms Time] [2021-08-30 17:42:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-30 17:42:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-08-30 17:42:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 87 states have internal predecessors, (101), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2021-08-30 17:42:29,822 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 31 [2021-08-30 17:42:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:29,822 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2021-08-30 17:42:29,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-30 17:42:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2021-08-30 17:42:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-30 17:42:29,823 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:29,823 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:29,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:30,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:30,037 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:30,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1860847279, now seen corresponding path program 1 times [2021-08-30 17:42:30,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:30,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771388634] [2021-08-30 17:42:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:30,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:42:30,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:30,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771388634] [2021-08-30 17:42:30,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771388634] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:30,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857882412] [2021-08-30 17:42:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:30,101 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:30,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:30,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:30,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-30 17:42:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:42:30,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:42:30,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:42:30,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857882412] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:30,411 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:30,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2021-08-30 17:42:30,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420910315] [2021-08-30 17:42:30,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:42:30,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:30,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:42:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:42:30,413 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:30,666 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2021-08-30 17:42:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-30 17:42:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2021-08-30 17:42:30,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:30,668 INFO L225 Difference]: With dead ends: 104 [2021-08-30 17:42:30,668 INFO L226 Difference]: Without dead ends: 101 [2021-08-30 17:42:30,668 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 169.87ms TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:42:30,669 INFO L928 BasicCegarLoop]: 6 mSDtfsCounter, 137 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 132.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.71ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 157.91ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:30,669 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 28 Invalid, 362 Unknown, 0 Unchecked, 2.71ms Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 157.91ms Time] [2021-08-30 17:42:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-08-30 17:42:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-08-30 17:42:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 87 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2021-08-30 17:42:30,671 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 46 [2021-08-30 17:42:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:30,671 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2021-08-30 17:42:30,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 15 states have internal predecessors, (65), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2021-08-30 17:42:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-30 17:42:30,672 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:30,672 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:30,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:30,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:30,877 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1743494932, now seen corresponding path program 2 times [2021-08-30 17:42:30,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:30,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749399472] [2021-08-30 17:42:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:30,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:42:30,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:30,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749399472] [2021-08-30 17:42:30,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749399472] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:30,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13774357] [2021-08-30 17:42:30,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:30,943 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:30,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:30,943 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:30,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-30 17:42:30,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:30,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:30,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:42:30,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:31,010 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:42:31,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-30 17:42:31,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-08-30 17:42:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:42:31,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:31,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13774357] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:31,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:31,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2021-08-30 17:42:31,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303297668] [2021-08-30 17:42:31,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:42:31,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:42:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:42:31,325 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:31,335 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2021-08-30 17:42:31,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-30 17:42:31,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2021-08-30 17:42:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:31,336 INFO L225 Difference]: With dead ends: 96 [2021-08-30 17:42:31,336 INFO L226 Difference]: Without dead ends: 96 [2021-08-30 17:42:31,337 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 71.30ms TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-30 17:42:31,337 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.24ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 8.35ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:31,337 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 77 Unknown, 0 Unchecked, 0.24ms Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 63 Unchecked, 8.35ms Time] [2021-08-30 17:42:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-30 17:42:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-30 17:42:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 86 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2021-08-30 17:42:31,339 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 51 [2021-08-30 17:42:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:31,340 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2021-08-30 17:42:31,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2021-08-30 17:42:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-30 17:42:31,340 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:31,340 INFO L513 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:31,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:31,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-30 17:42:31,557 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1031120918, now seen corresponding path program 1 times [2021-08-30 17:42:31,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:31,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351488802] [2021-08-30 17:42:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:31,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:31,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:31,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 67 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-30 17:42:31,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:31,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351488802] [2021-08-30 17:42:31,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351488802] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:31,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683898906] [2021-08-30 17:42:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:31,618 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:31,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:31,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-30 17:42:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:31,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:42:31,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:42:31,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-30 17:42:31,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683898906] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:31,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:31,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 16 [2021-08-30 17:42:31,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655607014] [2021-08-30 17:42:31,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-30 17:42:31,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-30 17:42:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-08-30 17:42:31,889 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:32,095 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2021-08-30 17:42:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-30 17:42:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2021-08-30 17:42:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:32,096 INFO L225 Difference]: With dead ends: 124 [2021-08-30 17:42:32,096 INFO L226 Difference]: Without dead ends: 124 [2021-08-30 17:42:32,097 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 135.19ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-08-30 17:42:32,098 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.63ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.31ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:32,098 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 40 Invalid, 368 Unknown, 0 Unchecked, 1.63ms Time], IncrementalHoareTripleChecker [15 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 135.31ms Time] [2021-08-30 17:42:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-30 17:42:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2021-08-30 17:42:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 105 states have internal predecessors, (116), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-08-30 17:42:32,102 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 52 [2021-08-30 17:42:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:32,103 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-08-30 17:42:32,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 14 states have internal predecessors, (72), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-08-30 17:42:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2021-08-30 17:42:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-30 17:42:32,103 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:32,104 INFO L513 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:32,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:32,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-08-30 17:42:32,321 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1260310061, now seen corresponding path program 2 times [2021-08-30 17:42:32,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:32,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124884983] [2021-08-30 17:42:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:32,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 144 proven. 26 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:42:32,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:32,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124884983] [2021-08-30 17:42:32,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124884983] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:32,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731710180] [2021-08-30 17:42:32,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:32,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:32,437 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-30 17:42:32,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:32,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:32,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-30 17:42:32,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:42:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 160 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-08-30 17:42:32,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731710180] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:32,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:32,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2021-08-30 17:42:32,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496703288] [2021-08-30 17:42:32,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-30 17:42:32,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-30 17:42:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:42:32,878 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:33,134 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2021-08-30 17:42:33,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-30 17:42:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 78 [2021-08-30 17:42:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:33,135 INFO L225 Difference]: With dead ends: 156 [2021-08-30 17:42:33,135 INFO L226 Difference]: Without dead ends: 156 [2021-08-30 17:42:33,135 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 190.87ms TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2021-08-30 17:42:33,136 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 129.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 157.86ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:33,136 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 35 Invalid, 400 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [27 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 157.86ms Time] [2021-08-30 17:42:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-30 17:42:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2021-08-30 17:42:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 127 states have (on average 1.110236220472441) internal successors, (141), 129 states have internal predecessors, (141), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-08-30 17:42:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2021-08-30 17:42:33,139 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 78 [2021-08-30 17:42:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:33,139 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2021-08-30 17:42:33,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-08-30 17:42:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2021-08-30 17:42:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-30 17:42:33,140 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:33,140 INFO L513 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:33,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:33,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-08-30 17:42:33,341 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash -526178640, now seen corresponding path program 3 times [2021-08-30 17:42:33,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:33,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065061885] [2021-08-30 17:42:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:33,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:33,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:33,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 304 proven. 26 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-08-30 17:42:33,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:33,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065061885] [2021-08-30 17:42:33,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065061885] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:33,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363505048] [2021-08-30 17:42:33,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:42:33,459 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:33,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:33,459 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:33,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-30 17:42:33,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-08-30 17:42:33,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:33,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-30 17:42:33,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 207 proven. 28 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-30 17:42:33,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 194 proven. 41 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-08-30 17:42:34,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363505048] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:34,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:34,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-08-30 17:42:34,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826108285] [2021-08-30 17:42:34,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-08-30 17:42:34,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-08-30 17:42:34,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2021-08-30 17:42:34,027 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:35,200 INFO L93 Difference]: Finished difference Result 317 states and 338 transitions. [2021-08-30 17:42:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-08-30 17:42:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2021-08-30 17:42:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:35,205 INFO L225 Difference]: With dead ends: 317 [2021-08-30 17:42:35,205 INFO L226 Difference]: Without dead ends: 311 [2021-08-30 17:42:35,207 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 864.71ms TimeCoverageRelationStatistics Valid=735, Invalid=3555, Unknown=0, NotChecked=0, Total=4290 [2021-08-30 17:42:35,207 INFO L928 BasicCegarLoop]: 7 mSDtfsCounter, 831 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 395.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.41ms SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 470.10ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:35,207 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 91 Invalid, 1226 Unknown, 0 Unchecked, 6.41ms Time], IncrementalHoareTripleChecker [207 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 470.10ms Time] [2021-08-30 17:42:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-08-30 17:42:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 242. [2021-08-30 17:42:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 221 states have (on average 1.1085972850678734) internal successors, (245), 224 states have internal predecessors, (245), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 266 transitions. [2021-08-30 17:42:35,216 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 266 transitions. Word has length 104 [2021-08-30 17:42:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:35,217 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 266 transitions. [2021-08-30 17:42:35,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.896551724137931) internal successors, (113), 26 states have internal predecessors, (113), 13 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2021-08-30 17:42:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-08-30 17:42:35,218 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:35,219 INFO L513 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:35,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:35,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-08-30 17:42:35,437 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1595613725, now seen corresponding path program 2 times [2021-08-30 17:42:35,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:35,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745179326] [2021-08-30 17:42:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:35,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-08-30 17:42:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-08-30 17:42:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-08-30 17:42:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-08-30 17:42:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2021-08-30 17:42:35,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:35,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745179326] [2021-08-30 17:42:35,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745179326] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:35,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888016611] [2021-08-30 17:42:35,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:35,558 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:35,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:35,558 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:35,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-08-30 17:42:35,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:42:35,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:35,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:42:35,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:35,620 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-08-30 17:42:35,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-30 17:42:35,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-08-30 17:42:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2578 trivial. 0 not checked. [2021-08-30 17:42:36,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:36,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888016611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:36,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:36,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2021-08-30 17:42:36,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568678259] [2021-08-30 17:42:36,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-30 17:42:36,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-30 17:42:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:42:36,757 INFO L87 Difference]: Start difference. First operand 242 states and 266 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:36,766 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2021-08-30 17:42:36,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-30 17:42:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 243 [2021-08-30 17:42:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:36,768 INFO L225 Difference]: With dead ends: 242 [2021-08-30 17:42:36,768 INFO L226 Difference]: Without dead ends: 242 [2021-08-30 17:42:36,768 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 242 SyntacticMatches, 16 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 90.51ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-30 17:42:36,769 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.18ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 5.87ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:36,769 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 43 Unknown, 0 Unchecked, 0.18ms Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 32 Unchecked, 5.87ms Time] [2021-08-30 17:42:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-30 17:42:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-30 17:42:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 221 states have (on average 1.1040723981900453) internal successors, (244), 224 states have internal predecessors, (244), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2021-08-30 17:42:36,776 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 243 [2021-08-30 17:42:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:36,777 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2021-08-30 17:42:36,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2021-08-30 17:42:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-08-30 17:42:36,779 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:36,779 INFO L513 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:36,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:36,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:36,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr4ENSURES_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1769549589, now seen corresponding path program 1 times [2021-08-30 17:42:36,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:36,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999132492] [2021-08-30 17:42:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:36,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-08-30 17:42:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-08-30 17:42:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2021-08-30 17:42:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-08-30 17:42:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 319 proven. 416 refuted. 0 times theorem prover too weak. 1843 trivial. 0 not checked. [2021-08-30 17:42:37,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:37,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999132492] [2021-08-30 17:42:37,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999132492] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:37,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086445318] [2021-08-30 17:42:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:37,155 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:37,157 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-08-30 17:42:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:37,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-30 17:42:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 1569 proven. 34 refuted. 0 times theorem prover too weak. 975 trivial. 0 not checked. [2021-08-30 17:42:37,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2578 backedges. 333 proven. 402 refuted. 0 times theorem prover too weak. 1843 trivial. 0 not checked. [2021-08-30 17:42:38,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086445318] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:38,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:38,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2021-08-30 17:42:38,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103897742] [2021-08-30 17:42:38,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-30 17:42:38,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-30 17:42:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2021-08-30 17:42:38,185 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 23 states have internal predecessors, (124), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-30 17:42:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:38,569 INFO L93 Difference]: Finished difference Result 280 states and 297 transitions. [2021-08-30 17:42:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-30 17:42:38,569 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 23 states have internal predecessors, (124), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 246 [2021-08-30 17:42:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:38,570 INFO L225 Difference]: With dead ends: 280 [2021-08-30 17:42:38,570 INFO L226 Difference]: Without dead ends: 271 [2021-08-30 17:42:38,571 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 299.07ms TimeCoverageRelationStatistics Valid=331, Invalid=929, Unknown=0, NotChecked=0, Total=1260 [2021-08-30 17:42:38,571 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 201 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 199.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.43ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 246.86ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:38,571 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 39 Invalid, 622 Unknown, 0 Unchecked, 3.43ms Time], IncrementalHoareTripleChecker [32 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 246.86ms Time] [2021-08-30 17:42:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-08-30 17:42:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 252. [2021-08-30 17:42:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 231 states have (on average 1.0952380952380953) internal successors, (253), 234 states have internal predecessors, (253), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 274 transitions. [2021-08-30 17:42:38,576 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 274 transitions. Word has length 246 [2021-08-30 17:42:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:38,576 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 274 transitions. [2021-08-30 17:42:38,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.166666666666667) internal successors, (124), 23 states have internal predecessors, (124), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-08-30 17:42:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 274 transitions. [2021-08-30 17:42:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-30 17:42:38,578 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:38,579 INFO L513 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:38,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-08-30 17:42:38,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-08-30 17:42:38,793 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr4ENSURES_VIOLATIONMEMORY_LEAK === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1601901522, now seen corresponding path program 2 times [2021-08-30 17:42:38,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:38,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308720761] [2021-08-30 17:42:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:38,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-08-30 17:42:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-08-30 17:42:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-08-30 17:42:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 523 proven. 492 refuted. 0 times theorem prover too weak. 2378 trivial. 0 not checked. [2021-08-30 17:42:38,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:38,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308720761] [2021-08-30 17:42:38,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308720761] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:38,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918993811] [2021-08-30 17:42:38,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:38,987 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:38,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:38,988 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:38,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-08-30 17:42:39,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-30 17:42:39,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:39,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-30 17:42:39,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:39,079 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:39,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:39,352 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:39,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:39,662 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:39,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:40,057 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:40,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:40,516 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:40,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:40,937 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:40,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:41,355 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:41,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:41,783 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-08-30 17:42:41,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 21 [2021-08-30 17:42:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3393 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3393 trivial. 0 not checked. [2021-08-30 17:42:42,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-08-30 17:42:42,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918993811] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-30 17:42:42,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-30 17:42:42,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2021-08-30 17:42:42,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800173616] [2021-08-30 17:42:42,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-30 17:42:42,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-30 17:42:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-08-30 17:42:42,204 INFO L87 Difference]: Start difference. First operand 252 states and 274 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:42,238 INFO L93 Difference]: Finished difference Result 252 states and 273 transitions. [2021-08-30 17:42:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-30 17:42:42,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 271 [2021-08-30 17:42:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:42,239 INFO L225 Difference]: With dead ends: 252 [2021-08-30 17:42:42,239 INFO L226 Difference]: Without dead ends: 248 [2021-08-30 17:42:42,240 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 269 SyntacticMatches, 15 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 289.26ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-08-30 17:42:42,240 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 22.42ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:42,240 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 37 Unchecked, 22.42ms Time] [2021-08-30 17:42:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-08-30 17:42:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 221. [2021-08-30 17:42:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.0348258706467661) internal successors, (208), 203 states have internal predecessors, (208), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 229 transitions. [2021-08-30 17:42:42,245 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 229 transitions. Word has length 271 [2021-08-30 17:42:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:42,245 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 229 transitions. [2021-08-30 17:42:42,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-30 17:42:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 229 transitions. [2021-08-30 17:42:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-08-30 17:42:42,247 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:42,248 INFO L513 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:42,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:42,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:42,453 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:42,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1880568583, now seen corresponding path program 1 times [2021-08-30 17:42:42,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:42,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004955636] [2021-08-30 17:42:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:42,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-08-30 17:42:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-08-30 17:42:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2021-08-30 17:42:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 523 proven. 492 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2021-08-30 17:42:42,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:42,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004955636] [2021-08-30 17:42:42,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004955636] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:42,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381501960] [2021-08-30 17:42:42,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:42,620 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:42,625 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:42,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-30 17:42:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:42,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 14 conjunts are in the unsatisfiable core [2021-08-30 17:42:42,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 2175 proven. 55 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2021-08-30 17:42:43,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3395 backedges. 543 proven. 472 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2021-08-30 17:42:43,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381501960] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:43,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:43,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2021-08-30 17:42:43,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596766512] [2021-08-30 17:42:43,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-08-30 17:42:43,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-08-30 17:42:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2021-08-30 17:42:43,696 INFO L87 Difference]: Start difference. First operand 221 states and 229 transitions. Second operand has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-30 17:42:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:44,150 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2021-08-30 17:42:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-30 17:42:44,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 272 [2021-08-30 17:42:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:44,154 INFO L225 Difference]: With dead ends: 268 [2021-08-30 17:42:44,154 INFO L226 Difference]: Without dead ends: 262 [2021-08-30 17:42:44,154 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 354.30ms TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2021-08-30 17:42:44,155 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 199 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 235.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.54ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 285.69ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:44,155 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 54 Invalid, 833 Unknown, 0 Unchecked, 4.54ms Time], IncrementalHoareTripleChecker [40 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 285.69ms Time] [2021-08-30 17:42:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-08-30 17:42:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2021-08-30 17:42:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 206 states have (on average 1.029126213592233) internal successors, (212), 208 states have internal predecessors, (212), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2021-08-30 17:42:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 233 transitions. [2021-08-30 17:42:44,159 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 233 transitions. Word has length 272 [2021-08-30 17:42:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:44,159 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 233 transitions. [2021-08-30 17:42:44,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.142857142857143) internal successors, (144), 27 states have internal predecessors, (144), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-30 17:42:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 233 transitions. [2021-08-30 17:42:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-08-30 17:42:44,160 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:44,160 INFO L513 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:44,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:44,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:44,376 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1647898235, now seen corresponding path program 2 times [2021-08-30 17:42:44,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:44,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591491825] [2021-08-30 17:42:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:44,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2021-08-30 17:42:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2021-08-30 17:42:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4137 backedges. 804 proven. 499 refuted. 0 times theorem prover too weak. 2834 trivial. 0 not checked. [2021-08-30 17:42:44,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:44,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591491825] [2021-08-30 17:42:44,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591491825] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:44,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991689233] [2021-08-30 17:42:44,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:42:44,592 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:44,593 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:44,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-30 17:42:44,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:42:44,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:44,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-30 17:42:44,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4137 backedges. 2574 proven. 81 refuted. 0 times theorem prover too weak. 1482 trivial. 0 not checked. [2021-08-30 17:42:45,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4137 backedges. 830 proven. 473 refuted. 0 times theorem prover too weak. 2834 trivial. 0 not checked. [2021-08-30 17:42:45,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991689233] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:45,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:45,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2021-08-30 17:42:45,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36579418] [2021-08-30 17:42:45,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-08-30 17:42:45,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:45,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-08-30 17:42:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2021-08-30 17:42:45,782 INFO L87 Difference]: Start difference. First operand 226 states and 233 transitions. Second operand has 32 states, 32 states have (on average 5.125) internal successors, (164), 31 states have internal predecessors, (164), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:42:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:46,301 INFO L93 Difference]: Finished difference Result 292 states and 302 transitions. [2021-08-30 17:42:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-30 17:42:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.125) internal successors, (164), 31 states have internal predecessors, (164), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 292 [2021-08-30 17:42:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:46,303 INFO L225 Difference]: With dead ends: 292 [2021-08-30 17:42:46,303 INFO L226 Difference]: Without dead ends: 289 [2021-08-30 17:42:46,304 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 586 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 468.07ms TimeCoverageRelationStatistics Valid=576, Invalid=1680, Unknown=0, NotChecked=0, Total=2256 [2021-08-30 17:42:46,304 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 244 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 247.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.29ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 305.84ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:46,304 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 54 Invalid, 801 Unknown, 0 Unchecked, 3.29ms Time], IncrementalHoareTripleChecker [47 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 305.84ms Time] [2021-08-30 17:42:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-30 17:42:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 238. [2021-08-30 17:42:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 217 states have (on average 1.032258064516129) internal successors, (224), 220 states have internal predecessors, (224), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2021-08-30 17:42:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2021-08-30 17:42:46,309 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 292 [2021-08-30 17:42:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:46,309 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2021-08-30 17:42:46,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.125) internal successors, (164), 31 states have internal predecessors, (164), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:42:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2021-08-30 17:42:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-08-30 17:42:46,311 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:46,311 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:46,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:46,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-08-30 17:42:46,525 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr3REQUIRES_VIOLATION === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2019751258, now seen corresponding path program 3 times [2021-08-30 17:42:46,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:46,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976552964] [2021-08-30 17:42:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:46,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-08-30 17:42:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 1177 proven. 407 refuted. 0 times theorem prover too weak. 3162 trivial. 0 not checked. [2021-08-30 17:42:46,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:46,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976552964] [2021-08-30 17:42:46,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976552964] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:46,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677802165] [2021-08-30 17:42:46,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:42:46,785 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:46,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:46,785 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:46,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-30 17:42:46,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-30 17:42:46,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:46,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-30 17:42:46,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 4722 trivial. 0 not checked. [2021-08-30 17:42:47,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:47,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-08-30 17:42:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4746 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4722 trivial. 0 not checked. [2021-08-30 17:42:47,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677802165] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:47,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:47,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 31 [2021-08-30 17:42:47,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994269510] [2021-08-30 17:42:47,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-30 17:42:47,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-30 17:42:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2021-08-30 17:42:47,832 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand has 31 states, 31 states have (on average 4.161290322580645) internal successors, (129), 30 states have internal predecessors, (129), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2021-08-30 17:42:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:48,653 INFO L93 Difference]: Finished difference Result 327 states and 341 transitions. [2021-08-30 17:42:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-30 17:42:48,653 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.161290322580645) internal successors, (129), 30 states have internal predecessors, (129), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 307 [2021-08-30 17:42:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:48,654 INFO L225 Difference]: With dead ends: 327 [2021-08-30 17:42:48,654 INFO L226 Difference]: Without dead ends: 295 [2021-08-30 17:42:48,655 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 632.37ms TimeCoverageRelationStatistics Valid=573, Invalid=2849, Unknown=0, NotChecked=0, Total=3422 [2021-08-30 17:42:48,656 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 349 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 351.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 430.40ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:48,656 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 83 Invalid, 1093 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [172 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 430.40ms Time] [2021-08-30 17:42:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-30 17:42:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 243. [2021-08-30 17:42:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 222 states have (on average 1.0315315315315314) internal successors, (229), 225 states have internal predecessors, (229), 11 states have call successors, (11), 8 states have call predecessors, (11), 9 states have return successors, (13), 9 states have call predecessors, (13), 10 states have call successors, (13) [2021-08-30 17:42:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 253 transitions. [2021-08-30 17:42:48,660 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 253 transitions. Word has length 307 [2021-08-30 17:42:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:48,662 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 253 transitions. [2021-08-30 17:42:48,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.161290322580645) internal successors, (129), 30 states have internal predecessors, (129), 11 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2021-08-30 17:42:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 253 transitions. [2021-08-30 17:42:48,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2021-08-30 17:42:48,664 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:48,664 INFO L513 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:48,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:48,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:48,881 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1575570451, now seen corresponding path program 4 times [2021-08-30 17:42:48,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:48,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110684437] [2021-08-30 17:42:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:48,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:48,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:48,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 3105 proven. 186 refuted. 0 times theorem prover too weak. 3419 trivial. 0 not checked. [2021-08-30 17:42:49,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:49,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110684437] [2021-08-30 17:42:49,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110684437] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:49,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413393735] [2021-08-30 17:42:49,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:42:49,152 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:49,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:49,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-30 17:42:49,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:42:49,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:49,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:42:49,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 3050 proven. 647 refuted. 0 times theorem prover too weak. 3013 trivial. 0 not checked. [2021-08-30 17:42:50,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6710 backedges. 3056 proven. 641 refuted. 0 times theorem prover too weak. 3013 trivial. 0 not checked. [2021-08-30 17:42:50,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413393735] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:50,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:50,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 45 [2021-08-30 17:42:50,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243707742] [2021-08-30 17:42:50,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-08-30 17:42:50,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-08-30 17:42:50,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1605, Unknown=0, NotChecked=0, Total=1980 [2021-08-30 17:42:50,768 INFO L87 Difference]: Start difference. First operand 243 states and 253 transitions. Second operand has 45 states, 45 states have (on average 4.8) internal successors, (216), 44 states have internal predecessors, (216), 10 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:42:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:51,625 INFO L93 Difference]: Finished difference Result 303 states and 319 transitions. [2021-08-30 17:42:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-30 17:42:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.8) internal successors, (216), 44 states have internal predecessors, (216), 10 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 344 [2021-08-30 17:42:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:51,627 INFO L225 Difference]: With dead ends: 303 [2021-08-30 17:42:51,627 INFO L226 Difference]: Without dead ends: 300 [2021-08-30 17:42:51,628 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 680 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 928.32ms TimeCoverageRelationStatistics Valid=1027, Invalid=3395, Unknown=0, NotChecked=0, Total=4422 [2021-08-30 17:42:51,629 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 383 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 328.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.48ms SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 401.52ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:51,629 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 56 Invalid, 1078 Unknown, 0 Unchecked, 4.48ms Time], IncrementalHoareTripleChecker [64 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 401.52ms Time] [2021-08-30 17:42:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-08-30 17:42:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 257. [2021-08-30 17:42:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 235 states have (on average 1.0297872340425531) internal successors, (242), 239 states have internal predecessors, (242), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2021-08-30 17:42:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 269 transitions. [2021-08-30 17:42:51,634 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 269 transitions. Word has length 344 [2021-08-30 17:42:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:51,634 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 269 transitions. [2021-08-30 17:42:51,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.8) internal successors, (216), 44 states have internal predecessors, (216), 10 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2021-08-30 17:42:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 269 transitions. [2021-08-30 17:42:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-08-30 17:42:51,636 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:51,636 INFO L513 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:51,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:51,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:51,853 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1526039033, now seen corresponding path program 5 times [2021-08-30 17:42:51,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:51,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704944435] [2021-08-30 17:42:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:51,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7760 backedges. 2148 proven. 198 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2021-08-30 17:42:52,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:52,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704944435] [2021-08-30 17:42:52,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704944435] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:52,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809594979] [2021-08-30 17:42:52,040 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:42:52,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:52,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:52,045 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:52,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-08-30 17:42:52,305 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2021-08-30 17:42:52,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:52,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-30 17:42:52,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7760 backedges. 2148 proven. 198 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2021-08-30 17:42:52,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7760 backedges. 2148 proven. 198 refuted. 0 times theorem prover too weak. 5414 trivial. 0 not checked. [2021-08-30 17:42:53,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809594979] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:53,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:53,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2021-08-30 17:42:53,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533474732] [2021-08-30 17:42:53,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-30 17:42:53,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-30 17:42:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2021-08-30 17:42:53,449 INFO L87 Difference]: Start difference. First operand 257 states and 269 transitions. Second operand has 25 states, 24 states have (on average 4.875) internal successors, (117), 24 states have internal predecessors, (117), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:42:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:54,216 INFO L93 Difference]: Finished difference Result 555 states and 637 transitions. [2021-08-30 17:42:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-30 17:42:54,217 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.875) internal successors, (117), 24 states have internal predecessors, (117), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 364 [2021-08-30 17:42:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:54,219 INFO L225 Difference]: With dead ends: 555 [2021-08-30 17:42:54,219 INFO L226 Difference]: Without dead ends: 555 [2021-08-30 17:42:54,220 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 776 GetRequests, 731 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 575.31ms TimeCoverageRelationStatistics Valid=542, Invalid=1438, Unknown=0, NotChecked=0, Total=1980 [2021-08-30 17:42:54,220 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 569 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 308.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 373.46ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:54,220 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 157 Invalid, 1012 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [43 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 373.46ms Time] [2021-08-30 17:42:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-30 17:42:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 312. [2021-08-30 17:42:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 290 states have (on average 1.0620689655172413) internal successors, (308), 294 states have internal predecessors, (308), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2021-08-30 17:42:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 335 transitions. [2021-08-30 17:42:54,233 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 335 transitions. Word has length 364 [2021-08-30 17:42:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:54,234 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 335 transitions. [2021-08-30 17:42:54,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.875) internal successors, (117), 24 states have internal predecessors, (117), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-30 17:42:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 335 transitions. [2021-08-30 17:42:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2021-08-30 17:42:54,237 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:54,237 INFO L513 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:54,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-08-30 17:42:54,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:54,453 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1547115480, now seen corresponding path program 6 times [2021-08-30 17:42:54,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:54,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91087019] [2021-08-30 17:42:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:54,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11060 backedges. 4900 proven. 693 refuted. 0 times theorem prover too weak. 5467 trivial. 0 not checked. [2021-08-30 17:42:54,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:54,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91087019] [2021-08-30 17:42:54,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91087019] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:54,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353700372] [2021-08-30 17:42:54,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:42:54,753 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:54,754 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:54,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-08-30 17:42:54,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2021-08-30 17:42:54,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:42:55,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-30 17:42:55,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11060 backedges. 4741 proven. 204 refuted. 0 times theorem prover too weak. 6115 trivial. 0 not checked. [2021-08-30 17:42:55,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:42:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 11060 backedges. 4664 proven. 281 refuted. 0 times theorem prover too weak. 6115 trivial. 0 not checked. [2021-08-30 17:42:56,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353700372] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:42:56,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:42:56,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 15] total 43 [2021-08-30 17:42:56,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489862903] [2021-08-30 17:42:56,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-08-30 17:42:56,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:42:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-08-30 17:42:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2021-08-30 17:42:56,278 INFO L87 Difference]: Start difference. First operand 312 states and 335 transitions. Second operand has 43 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 20 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-08-30 17:42:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:42:57,132 INFO L93 Difference]: Finished difference Result 567 states and 615 transitions. [2021-08-30 17:42:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-08-30 17:42:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 20 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Word has length 419 [2021-08-30 17:42:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:42:57,135 INFO L225 Difference]: With dead ends: 567 [2021-08-30 17:42:57,135 INFO L226 Difference]: Without dead ends: 567 [2021-08-30 17:42:57,136 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 839 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 854.00ms TimeCoverageRelationStatistics Valid=1011, Invalid=3819, Unknown=0, NotChecked=0, Total=4830 [2021-08-30 17:42:57,136 INFO L928 BasicCegarLoop]: 5 mSDtfsCounter, 194 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 283.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.27ms SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 348.43ms IncrementalHoareTripleChecker+Time [2021-08-30 17:42:57,136 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 59 Invalid, 914 Unknown, 0 Unchecked, 3.27ms Time], IncrementalHoareTripleChecker [84 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 348.43ms Time] [2021-08-30 17:42:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-08-30 17:42:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 507. [2021-08-30 17:42:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 473 states have (on average 1.0507399577167018) internal successors, (497), 477 states have internal predecessors, (497), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2021-08-30 17:42:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 544 transitions. [2021-08-30 17:42:57,144 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 544 transitions. Word has length 419 [2021-08-30 17:42:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:42:57,144 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 544 transitions. [2021-08-30 17:42:57,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.116279069767442) internal successors, (177), 40 states have internal predecessors, (177), 20 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-08-30 17:42:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 544 transitions. [2021-08-30 17:42:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2021-08-30 17:42:57,151 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:42:57,151 INFO L513 BasicCegarLoop]: trace histogram [155, 154, 154, 154, 154, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:42:57,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-08-30 17:42:57,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-30 17:42:57,363 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:42:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:42:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash -762954746, now seen corresponding path program 7 times [2021-08-30 17:42:57,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:42:57,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047291029] [2021-08-30 17:42:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:42:57,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:42:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:42:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:42:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:42:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:42:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:42:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:42:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:42:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:42:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:42:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:42:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 371 [2021-08-30 17:42:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2021-08-30 17:42:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2021-08-30 17:42:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2021-08-30 17:42:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2021-08-30 17:42:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 651 [2021-08-30 17:42:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2021-08-30 17:42:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 763 [2021-08-30 17:42:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 819 [2021-08-30 17:42:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 63740 backedges. 16832 proven. 4076 refuted. 0 times theorem prover too weak. 42832 trivial. 0 not checked. [2021-08-30 17:42:57,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:42:57,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047291029] [2021-08-30 17:42:57,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047291029] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:42:57,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779975878] [2021-08-30 17:42:57,835 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:42:57,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:42:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:42:57,836 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:42:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-08-30 17:42:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:42:58,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 2505 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:42:58,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:42:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 63740 backedges. 31492 proven. 189 refuted. 0 times theorem prover too weak. 32059 trivial. 0 not checked. [2021-08-30 17:42:59,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 63740 backedges. 16876 proven. 4032 refuted. 0 times theorem prover too weak. 42832 trivial. 0 not checked. [2021-08-30 17:43:00,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779975878] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:00,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:00,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2021-08-30 17:43:00,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478174464] [2021-08-30 17:43:00,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-08-30 17:43:00,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:00,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-30 17:43:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1460, Unknown=0, NotChecked=0, Total=1892 [2021-08-30 17:43:00,933 INFO L87 Difference]: Start difference. First operand 507 states and 544 transitions. Second operand has 44 states, 44 states have (on average 4.954545454545454) internal successors, (218), 43 states have internal predecessors, (218), 12 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2021-08-30 17:43:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:01,515 INFO L93 Difference]: Finished difference Result 543 states and 581 transitions. [2021-08-30 17:43:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-08-30 17:43:01,515 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.954545454545454) internal successors, (218), 43 states have internal predecessors, (218), 12 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 979 [2021-08-30 17:43:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:01,517 INFO L225 Difference]: With dead ends: 543 [2021-08-30 17:43:01,517 INFO L226 Difference]: Without dead ends: 534 [2021-08-30 17:43:01,518 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2039 GetRequests, 1973 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 784.89ms TimeCoverageRelationStatistics Valid=1071, Invalid=3219, Unknown=0, NotChecked=0, Total=4290 [2021-08-30 17:43:01,519 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 385 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 220.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.87ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 278.82ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:01,519 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 74 Invalid, 699 Unknown, 0 Unchecked, 2.87ms Time], IncrementalHoareTripleChecker [61 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 278.82ms Time] [2021-08-30 17:43:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-08-30 17:43:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2021-08-30 17:43:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 478 states have (on average 1.0460251046025104) internal successors, (500), 482 states have internal predecessors, (500), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2021-08-30 17:43:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 547 transitions. [2021-08-30 17:43:01,531 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 547 transitions. Word has length 979 [2021-08-30 17:43:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:01,531 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 547 transitions. [2021-08-30 17:43:01,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.954545454545454) internal successors, (218), 43 states have internal predecessors, (218), 12 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2021-08-30 17:43:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 547 transitions. [2021-08-30 17:43:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2021-08-30 17:43:01,539 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:01,539 INFO L513 BasicCegarLoop]: trace histogram [165, 164, 164, 164, 164, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:01,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:01,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-30 17:43:01,742 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash -690925464, now seen corresponding path program 8 times [2021-08-30 17:43:01,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:01,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979758573] [2021-08-30 17:43:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:01,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2021-08-30 17:43:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2021-08-30 17:43:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2021-08-30 17:43:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 620 [2021-08-30 17:43:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 681 [2021-08-30 17:43:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 742 [2021-08-30 17:43:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 803 [2021-08-30 17:43:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 864 [2021-08-30 17:43:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 71865 backedges. 18652 proven. 4477 refuted. 0 times theorem prover too weak. 48736 trivial. 0 not checked. [2021-08-30 17:43:02,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:02,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979758573] [2021-08-30 17:43:02,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979758573] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:02,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863828448] [2021-08-30 17:43:02,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:43:02,203 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:02,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:02,205 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-08-30 17:43:02,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:43:02,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:02,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:43:02,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 71865 backedges. 37678 proven. 235 refuted. 0 times theorem prover too weak. 33952 trivial. 0 not checked. [2021-08-30 17:43:03,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 71865 backedges. 18702 proven. 4427 refuted. 0 times theorem prover too weak. 48736 trivial. 0 not checked. [2021-08-30 17:43:05,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863828448] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:05,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:05,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2021-08-30 17:43:05,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074286255] [2021-08-30 17:43:05,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-08-30 17:43:05,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-08-30 17:43:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=1743, Unknown=0, NotChecked=0, Total=2256 [2021-08-30 17:43:05,390 INFO L87 Difference]: Start difference. First operand 512 states and 547 transitions. Second operand has 48 states, 48 states have (on average 4.958333333333333) internal successors, (238), 47 states have internal predecessors, (238), 13 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2021-08-30 17:43:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:06,142 INFO L93 Difference]: Finished difference Result 545 states and 582 transitions. [2021-08-30 17:43:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-08-30 17:43:06,142 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.958333333333333) internal successors, (238), 47 states have internal predecessors, (238), 13 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 1029 [2021-08-30 17:43:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:06,144 INFO L225 Difference]: With dead ends: 545 [2021-08-30 17:43:06,144 INFO L226 Difference]: Without dead ends: 539 [2021-08-30 17:43:06,145 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2143 GetRequests, 2071 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 889.38ms TimeCoverageRelationStatistics Valid=1270, Invalid=3842, Unknown=0, NotChecked=0, Total=5112 [2021-08-30 17:43:06,146 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 317 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 341.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.83ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 412.11ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:06,146 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 86 Invalid, 1137 Unknown, 0 Unchecked, 3.83ms Time], IncrementalHoareTripleChecker [53 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 412.11ms Time] [2021-08-30 17:43:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-08-30 17:43:06,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 517. [2021-08-30 17:43:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 483 states have (on average 1.0434782608695652) internal successors, (504), 487 states have internal predecessors, (504), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (26), 19 states have call predecessors, (26), 20 states have call successors, (26) [2021-08-30 17:43:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 551 transitions. [2021-08-30 17:43:06,153 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 551 transitions. Word has length 1029 [2021-08-30 17:43:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:06,154 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 551 transitions. [2021-08-30 17:43:06,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.958333333333333) internal successors, (238), 47 states have internal predecessors, (238), 13 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2021-08-30 17:43:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 551 transitions. [2021-08-30 17:43:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2021-08-30 17:43:06,161 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:06,161 INFO L513 BasicCegarLoop]: trace histogram [174, 173, 173, 173, 173, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:06,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:06,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-08-30 17:43:06,377 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1559050107, now seen corresponding path program 9 times [2021-08-30 17:43:06,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:06,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319387414] [2021-08-30 17:43:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:06,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 508 [2021-08-30 17:43:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2021-08-30 17:43:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 640 [2021-08-30 17:43:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 706 [2021-08-30 17:43:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 772 [2021-08-30 17:43:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 838 [2021-08-30 17:43:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 904 [2021-08-30 17:43:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 79605 backedges. 20522 proven. 4759 refuted. 0 times theorem prover too weak. 54324 trivial. 0 not checked. [2021-08-30 17:43:06,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:06,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319387414] [2021-08-30 17:43:06,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319387414] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:06,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045119992] [2021-08-30 17:43:06,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:43:06,936 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:06,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:06,938 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:06,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-08-30 17:43:07,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2021-08-30 17:43:07,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:07,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-30 17:43:07,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 79605 backedges. 23247 proven. 1449 refuted. 0 times theorem prover too weak. 54909 trivial. 0 not checked. [2021-08-30 17:43:08,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 79605 backedges. 23170 proven. 1526 refuted. 0 times theorem prover too weak. 54909 trivial. 0 not checked. [2021-08-30 17:43:10,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045119992] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:10,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:10,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 21] total 66 [2021-08-30 17:43:10,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001962919] [2021-08-30 17:43:10,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-08-30 17:43:10,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-08-30 17:43:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=803, Invalid=3487, Unknown=0, NotChecked=0, Total=4290 [2021-08-30 17:43:10,607 INFO L87 Difference]: Start difference. First operand 517 states and 551 transitions. Second operand has 66 states, 66 states have (on average 4.409090909090909) internal successors, (291), 63 states have internal predecessors, (291), 15 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2021-08-30 17:43:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:16,192 INFO L93 Difference]: Finished difference Result 1110 states and 1228 transitions. [2021-08-30 17:43:16,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2021-08-30 17:43:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 4.409090909090909) internal successors, (291), 63 states have internal predecessors, (291), 15 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 1074 [2021-08-30 17:43:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:16,196 INFO L225 Difference]: With dead ends: 1110 [2021-08-30 17:43:16,196 INFO L226 Difference]: Without dead ends: 1107 [2021-08-30 17:43:16,200 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2351 GetRequests, 2149 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13458 ImplicationChecksByTransitivity, 5700.40ms TimeCoverageRelationStatistics Valid=8741, Invalid=32265, Unknown=0, NotChecked=0, Total=41006 [2021-08-30 17:43:16,201 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 2316 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 633.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.36ms SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 746.84ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:16,201 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2318 Valid, 175 Invalid, 1959 Unknown, 0 Unchecked, 7.36ms Time], IncrementalHoareTripleChecker [517 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 746.84ms Time] [2021-08-30 17:43:16,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-08-30 17:43:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1058. [2021-08-30 17:43:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1005 states have (on average 1.0716417910447762) internal successors, (1077), 1015 states have internal predecessors, (1077), 30 states have call successors, (30), 14 states have call predecessors, (30), 22 states have return successors, (68), 28 states have call predecessors, (68), 29 states have call successors, (68) [2021-08-30 17:43:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1175 transitions. [2021-08-30 17:43:16,232 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1175 transitions. Word has length 1074 [2021-08-30 17:43:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:16,232 INFO L470 AbstractCegarLoop]: Abstraction has 1058 states and 1175 transitions. [2021-08-30 17:43:16,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 4.409090909090909) internal successors, (291), 63 states have internal predecessors, (291), 15 states have call successors, (19), 5 states have call predecessors, (19), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2021-08-30 17:43:16,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1175 transitions. [2021-08-30 17:43:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1175 [2021-08-30 17:43:16,243 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:16,243 INFO L513 BasicCegarLoop]: trace histogram [194, 193, 193, 193, 193, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:16,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:16,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:16,464 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash -597457235, now seen corresponding path program 10 times [2021-08-30 17:43:16,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:16,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632019217] [2021-08-30 17:43:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:16,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2021-08-30 17:43:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 655 [2021-08-30 17:43:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 726 [2021-08-30 17:43:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 797 [2021-08-30 17:43:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 868 [2021-08-30 17:43:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 939 [2021-08-30 17:43:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 98255 backedges. 23681 proven. 5624 refuted. 0 times theorem prover too weak. 68950 trivial. 0 not checked. [2021-08-30 17:43:17,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:17,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632019217] [2021-08-30 17:43:17,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632019217] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:17,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751508290] [2021-08-30 17:43:17,037 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:43:17,037 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:17,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:17,041 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:17,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-30 17:43:17,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:43:17,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:17,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 32 conjunts are in the unsatisfiable core [2021-08-30 17:43:17,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 98255 backedges. 54188 proven. 1371 refuted. 0 times theorem prover too weak. 42696 trivial. 0 not checked. [2021-08-30 17:43:19,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 98255 backedges. 23612 proven. 7545 refuted. 0 times theorem prover too weak. 67098 trivial. 0 not checked. [2021-08-30 17:43:20,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751508290] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:20,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:20,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 31] total 61 [2021-08-30 17:43:20,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987946147] [2021-08-30 17:43:20,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-08-30 17:43:20,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:20,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-08-30 17:43:20,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=2947, Unknown=0, NotChecked=0, Total=3660 [2021-08-30 17:43:20,952 INFO L87 Difference]: Start difference. First operand 1058 states and 1175 transitions. Second operand has 61 states, 61 states have (on average 4.901639344262295) internal successors, (299), 60 states have internal predecessors, (299), 14 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2021-08-30 17:43:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:22,107 INFO L93 Difference]: Finished difference Result 1092 states and 1198 transitions. [2021-08-30 17:43:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-08-30 17:43:22,107 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.901639344262295) internal successors, (299), 60 states have internal predecessors, (299), 14 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 1174 [2021-08-30 17:43:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:22,111 INFO L225 Difference]: With dead ends: 1092 [2021-08-30 17:43:22,111 INFO L226 Difference]: Without dead ends: 1089 [2021-08-30 17:43:22,112 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2443 GetRequests, 2352 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 1529.90ms TimeCoverageRelationStatistics Valid=1901, Invalid=6289, Unknown=0, NotChecked=0, Total=8190 [2021-08-30 17:43:22,112 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 471 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 381.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.82ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 458.64ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:22,113 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 55 Invalid, 1347 Unknown, 0 Unchecked, 3.82ms Time], IncrementalHoareTripleChecker [75 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 458.64ms Time] [2021-08-30 17:43:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-08-30 17:43:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1055. [2021-08-30 17:43:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1003 states have (on average 1.069790628115653) internal successors, (1073), 1012 states have internal predecessors, (1073), 30 states have call successors, (30), 14 states have call predecessors, (30), 21 states have return successors, (52), 28 states have call predecessors, (52), 29 states have call successors, (52) [2021-08-30 17:43:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1155 transitions. [2021-08-30 17:43:22,127 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1155 transitions. Word has length 1174 [2021-08-30 17:43:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 1055 states and 1155 transitions. [2021-08-30 17:43:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.901639344262295) internal successors, (299), 60 states have internal predecessors, (299), 14 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2021-08-30 17:43:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1155 transitions. [2021-08-30 17:43:22,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2021-08-30 17:43:22,149 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:22,149 INFO L513 BasicCegarLoop]: trace histogram [200, 199, 199, 199, 199, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:22,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:22,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:22,365 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -369136357, now seen corresponding path program 11 times [2021-08-30 17:43:22,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:22,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940515348] [2021-08-30 17:43:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:22,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2021-08-30 17:43:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 741 [2021-08-30 17:43:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 817 [2021-08-30 17:43:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 893 [2021-08-30 17:43:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 969 [2021-08-30 17:43:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 104240 backedges. 25594 proven. 5572 refuted. 0 times theorem prover too weak. 73074 trivial. 0 not checked. [2021-08-30 17:43:22,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:22,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940515348] [2021-08-30 17:43:22,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940515348] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:22,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458659309] [2021-08-30 17:43:22,951 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:43:22,951 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:22,953 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:22,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-08-30 17:43:23,697 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2021-08-30 17:43:23,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:23,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-30 17:43:23,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 104240 backedges. 63152 proven. 1339 refuted. 0 times theorem prover too weak. 39749 trivial. 0 not checked. [2021-08-30 17:43:25,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 104240 backedges. 30084 proven. 11503 refuted. 0 times theorem prover too weak. 62653 trivial. 0 not checked. [2021-08-30 17:43:28,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458659309] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:28,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:28,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 34] total 88 [2021-08-30 17:43:28,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214964621] [2021-08-30 17:43:28,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2021-08-30 17:43:28,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:28,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-08-30 17:43:28,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=6499, Unknown=0, NotChecked=0, Total=7656 [2021-08-30 17:43:28,323 INFO L87 Difference]: Start difference. First operand 1055 states and 1155 transitions. Second operand has 88 states, 88 states have (on average 4.875) internal successors, (429), 87 states have internal predecessors, (429), 15 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2021-08-30 17:43:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:30,557 INFO L93 Difference]: Finished difference Result 1206 states and 1313 transitions. [2021-08-30 17:43:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-08-30 17:43:30,558 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 4.875) internal successors, (429), 87 states have internal predecessors, (429), 15 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) Word has length 1204 [2021-08-30 17:43:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:30,561 INFO L225 Difference]: With dead ends: 1206 [2021-08-30 17:43:30,562 INFO L226 Difference]: Without dead ends: 1197 [2021-08-30 17:43:30,563 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2521 GetRequests, 2387 SyntacticMatches, 2 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4779 ImplicationChecksByTransitivity, 2551.49ms TimeCoverageRelationStatistics Valid=3375, Invalid=14447, Unknown=0, NotChecked=0, Total=17822 [2021-08-30 17:43:30,564 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 732 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3738 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 970.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.69ms SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 3738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1174.22ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:30,564 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [733 Valid, 112 Invalid, 3914 Unknown, 0 Unchecked, 9.69ms Time], IncrementalHoareTripleChecker [176 Valid, 3738 Invalid, 0 Unknown, 0 Unchecked, 1174.22ms Time] [2021-08-30 17:43:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-08-30 17:43:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1151. [2021-08-30 17:43:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 1094 states have (on average 1.059414990859232) internal successors, (1159), 1104 states have internal predecessors, (1159), 33 states have call successors, (33), 15 states have call predecessors, (33), 23 states have return successors, (61), 31 states have call predecessors, (61), 32 states have call successors, (61) [2021-08-30 17:43:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1253 transitions. [2021-08-30 17:43:30,605 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1253 transitions. Word has length 1204 [2021-08-30 17:43:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:30,606 INFO L470 AbstractCegarLoop]: Abstraction has 1151 states and 1253 transitions. [2021-08-30 17:43:30,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 4.875) internal successors, (429), 87 states have internal predecessors, (429), 15 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (18), 14 states have call predecessors, (18), 15 states have call successors, (18) [2021-08-30 17:43:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1253 transitions. [2021-08-30 17:43:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2021-08-30 17:43:30,617 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:30,618 INFO L513 BasicCegarLoop]: trace histogram [205, 204, 204, 204, 204, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:30,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:30,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-08-30 17:43:30,826 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:30,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:30,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1171578392, now seen corresponding path program 12 times [2021-08-30 17:43:30,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:30,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958977684] [2021-08-30 17:43:30,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:30,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 751 [2021-08-30 17:43:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 832 [2021-08-30 17:43:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 913 [2021-08-30 17:43:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 994 [2021-08-30 17:43:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 109365 backedges. 27602 proven. 5301 refuted. 0 times theorem prover too weak. 76462 trivial. 0 not checked. [2021-08-30 17:43:31,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:31,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958977684] [2021-08-30 17:43:31,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958977684] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:31,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716637094] [2021-08-30 17:43:31,494 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:43:31,494 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:31,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:31,495 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:31,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-08-30 17:43:32,115 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2021-08-30 17:43:32,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 26 conjunts are in the unsatisfiable core [2021-08-30 17:43:32,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 109365 backedges. 28642 proven. 3666 refuted. 0 times theorem prover too weak. 77057 trivial. 0 not checked. [2021-08-30 17:43:34,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 109365 backedges. 28565 proven. 3743 refuted. 0 times theorem prover too weak. 77057 trivial. 0 not checked. [2021-08-30 17:43:36,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716637094] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:36,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:36,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 25, 25] total 80 [2021-08-30 17:43:36,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091658040] [2021-08-30 17:43:36,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-08-30 17:43:36,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-08-30 17:43:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=5115, Unknown=0, NotChecked=0, Total=6320 [2021-08-30 17:43:36,406 INFO L87 Difference]: Start difference. First operand 1151 states and 1253 transitions. Second operand has 80 states, 80 states have (on average 4.5125) internal successors, (361), 77 states have internal predecessors, (361), 20 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2021-08-30 17:43:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:44,496 INFO L93 Difference]: Finished difference Result 2410 states and 2783 transitions. [2021-08-30 17:43:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2021-08-30 17:43:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 4.5125) internal successors, (361), 77 states have internal predecessors, (361), 20 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) Word has length 1229 [2021-08-30 17:43:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:44,511 INFO L225 Difference]: With dead ends: 2410 [2021-08-30 17:43:44,511 INFO L226 Difference]: Without dead ends: 2404 [2021-08-30 17:43:44,534 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2714 GetRequests, 2457 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22457 ImplicationChecksByTransitivity, 8136.30ms TimeCoverageRelationStatistics Valid=13350, Invalid=52956, Unknown=0, NotChecked=0, Total=66306 [2021-08-30 17:43:44,535 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 2876 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 2587 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 955.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2878 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.98ms SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1136.45ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:44,535 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2878 Valid, 243 Invalid, 3358 Unknown, 0 Unchecked, 11.98ms Time], IncrementalHoareTripleChecker [771 Valid, 2587 Invalid, 0 Unknown, 0 Unchecked, 1136.45ms Time] [2021-08-30 17:43:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2021-08-30 17:43:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2321. [2021-08-30 17:43:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 2214 states have (on average 1.0790424570912376) internal successors, (2389), 2237 states have internal predecessors, (2389), 64 states have call successors, (64), 21 states have call predecessors, (64), 42 states have return successors, (187), 62 states have call predecessors, (187), 63 states have call successors, (187) [2021-08-30 17:43:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2640 transitions. [2021-08-30 17:43:44,566 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2640 transitions. Word has length 1229 [2021-08-30 17:43:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:44,567 INFO L470 AbstractCegarLoop]: Abstraction has 2321 states and 2640 transitions. [2021-08-30 17:43:44,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 4.5125) internal successors, (361), 77 states have internal predecessors, (361), 20 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2021-08-30 17:43:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2640 transitions. [2021-08-30 17:43:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2021-08-30 17:43:44,584 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:44,585 INFO L513 BasicCegarLoop]: trace histogram [230, 229, 229, 229, 229, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:44,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:44,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-08-30 17:43:44,801 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1247996627, now seen corresponding path program 13 times [2021-08-30 17:43:44,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:44,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098514353] [2021-08-30 17:43:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:44,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2021-08-30 17:43:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 928 [2021-08-30 17:43:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1089 [2021-08-30 17:43:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 136865 backedges. 31862 proven. 6377 refuted. 0 times theorem prover too weak. 98626 trivial. 0 not checked. [2021-08-30 17:43:45,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:45,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098514353] [2021-08-30 17:43:45,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098514353] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:45,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313805976] [2021-08-30 17:43:45,512 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:43:45,512 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:45,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:45,513 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:45,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-08-30 17:43:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:45,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 3405 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-30 17:43:45,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 136865 backedges. 76228 proven. 540 refuted. 0 times theorem prover too weak. 60097 trivial. 0 not checked. [2021-08-30 17:43:47,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 136865 backedges. 31942 proven. 6297 refuted. 0 times theorem prover too weak. 98626 trivial. 0 not checked. [2021-08-30 17:43:49,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313805976] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:49,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:49,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2021-08-30 17:43:49,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321171753] [2021-08-30 17:43:49,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2021-08-30 17:43:49,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-08-30 17:43:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=3533, Unknown=0, NotChecked=0, Total=4556 [2021-08-30 17:43:49,907 INFO L87 Difference]: Start difference. First operand 2321 states and 2640 transitions. Second operand has 68 states, 68 states have (on average 4.970588235294118) internal successors, (338), 67 states have internal predecessors, (338), 18 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-08-30 17:43:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:51,016 INFO L93 Difference]: Finished difference Result 2381 states and 2726 transitions. [2021-08-30 17:43:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-08-30 17:43:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 4.970588235294118) internal successors, (338), 67 states have internal predecessors, (338), 18 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 1354 [2021-08-30 17:43:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:51,025 INFO L225 Difference]: With dead ends: 2381 [2021-08-30 17:43:51,025 INFO L226 Difference]: Without dead ends: 2375 [2021-08-30 17:43:51,026 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2813 GetRequests, 2711 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 1618.08ms TimeCoverageRelationStatistics Valid=2520, Invalid=7782, Unknown=0, NotChecked=0, Total=10302 [2021-08-30 17:43:51,027 INFO L928 BasicCegarLoop]: 20 mSDtfsCounter, 534 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 451.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.88ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 544.11ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:51,027 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 110 Invalid, 1738 Unknown, 0 Unchecked, 4.88ms Time], IncrementalHoareTripleChecker [103 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 544.11ms Time] [2021-08-30 17:43:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2021-08-30 17:43:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2338. [2021-08-30 17:43:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2227 states have (on average 1.0776829815895823) internal successors, (2400), 2254 states have internal predecessors, (2400), 64 states have call successors, (64), 21 states have call predecessors, (64), 46 states have return successors, (212), 62 states have call predecessors, (212), 63 states have call successors, (212) [2021-08-30 17:43:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 2676 transitions. [2021-08-30 17:43:51,057 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 2676 transitions. Word has length 1354 [2021-08-30 17:43:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:51,058 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 2676 transitions. [2021-08-30 17:43:51,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 4.970588235294118) internal successors, (338), 67 states have internal predecessors, (338), 18 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2021-08-30 17:43:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2676 transitions. [2021-08-30 17:43:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1365 [2021-08-30 17:43:51,074 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:51,074 INFO L513 BasicCegarLoop]: trace histogram [232, 231, 231, 231, 231, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:51,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:51,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:51,282 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash -606928115, now seen corresponding path program 14 times [2021-08-30 17:43:51,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:51,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991141799] [2021-08-30 17:43:51,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:51,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 938 [2021-08-30 17:43:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1099 [2021-08-30 17:43:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 139200 backedges. 34003 proven. 5602 refuted. 0 times theorem prover too weak. 99595 trivial. 0 not checked. [2021-08-30 17:43:52,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:52,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991141799] [2021-08-30 17:43:52,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991141799] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:52,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087093789] [2021-08-30 17:43:52,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:43:52,039 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:52,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:52,040 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:52,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-08-30 17:43:52,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:43:52,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:52,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 3429 conjuncts, 36 conjunts are in the unsatisfiable core [2021-08-30 17:43:52,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:43:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 139200 backedges. 74647 proven. 616 refuted. 0 times theorem prover too weak. 63937 trivial. 0 not checked. [2021-08-30 17:43:54,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:43:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 139200 backedges. 34089 proven. 5516 refuted. 0 times theorem prover too weak. 99595 trivial. 0 not checked. [2021-08-30 17:43:56,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087093789] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:43:56,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:43:56,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2021-08-30 17:43:56,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236955976] [2021-08-30 17:43:56,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2021-08-30 17:43:56,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:43:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-08-30 17:43:56,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1146, Invalid=3966, Unknown=0, NotChecked=0, Total=5112 [2021-08-30 17:43:56,636 INFO L87 Difference]: Start difference. First operand 2338 states and 2676 transitions. Second operand has 72 states, 72 states have (on average 4.972222222222222) internal successors, (358), 71 states have internal predecessors, (358), 19 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-08-30 17:43:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:43:57,753 INFO L93 Difference]: Finished difference Result 2400 states and 2754 transitions. [2021-08-30 17:43:57,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-08-30 17:43:57,757 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.972222222222222) internal successors, (358), 71 states have internal predecessors, (358), 19 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 1364 [2021-08-30 17:43:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:43:57,765 INFO L225 Difference]: With dead ends: 2400 [2021-08-30 17:43:57,765 INFO L226 Difference]: Without dead ends: 2394 [2021-08-30 17:43:57,767 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2837 GetRequests, 2729 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 1729.37ms TimeCoverageRelationStatistics Valid=2821, Invalid=8735, Unknown=0, NotChecked=0, Total=11556 [2021-08-30 17:43:57,767 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 515 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 420.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.39ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 504.62ms IncrementalHoareTripleChecker+Time [2021-08-30 17:43:57,767 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 135 Invalid, 1507 Unknown, 0 Unchecked, 4.39ms Time], IncrementalHoareTripleChecker [57 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 504.62ms Time] [2021-08-30 17:43:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2021-08-30 17:43:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2338. [2021-08-30 17:43:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2227 states have (on average 1.0763358778625953) internal successors, (2397), 2254 states have internal predecessors, (2397), 64 states have call successors, (64), 21 states have call predecessors, (64), 46 states have return successors, (206), 62 states have call predecessors, (206), 63 states have call successors, (206) [2021-08-30 17:43:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 2667 transitions. [2021-08-30 17:43:57,798 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 2667 transitions. Word has length 1364 [2021-08-30 17:43:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:43:57,800 INFO L470 AbstractCegarLoop]: Abstraction has 2338 states and 2667 transitions. [2021-08-30 17:43:57,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.972222222222222) internal successors, (358), 71 states have internal predecessors, (358), 19 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-08-30 17:43:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2667 transitions. [2021-08-30 17:43:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1370 [2021-08-30 17:43:57,816 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:43:57,816 INFO L513 BasicCegarLoop]: trace histogram [233, 232, 232, 232, 232, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:43:57,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2021-08-30 17:43:58,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:58,033 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:43:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:43:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1907218392, now seen corresponding path program 15 times [2021-08-30 17:43:58,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:43:58,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210206980] [2021-08-30 17:43:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:43:58,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:43:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:43:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:43:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:43:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:43:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:43:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:43:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:43:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:43:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:43:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:43:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:43:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:43:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:43:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:43:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:43:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:43:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:43:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:43:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1104 [2021-08-30 17:43:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:43:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 140375 backedges. 47531 proven. 5405 refuted. 0 times theorem prover too weak. 87439 trivial. 0 not checked. [2021-08-30 17:43:58,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:43:58,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210206980] [2021-08-30 17:43:58,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210206980] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:43:58,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196581190] [2021-08-30 17:43:58,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:43:58,847 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:43:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:43:58,848 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:43:58,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-08-30 17:43:59,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2021-08-30 17:43:59,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:43:59,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 1461 conjuncts, 24 conjunts are in the unsatisfiable core [2021-08-30 17:43:59,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 140375 backedges. 22002 proven. 990 refuted. 0 times theorem prover too weak. 117383 trivial. 0 not checked. [2021-08-30 17:44:01,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 140375 backedges. 22002 proven. 990 refuted. 0 times theorem prover too weak. 117383 trivial. 0 not checked. [2021-08-30 17:44:02,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196581190] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:02,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:02,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 23, 23] total 77 [2021-08-30 17:44:02,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882126737] [2021-08-30 17:44:02,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-08-30 17:44:02,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-08-30 17:44:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=972, Invalid=4880, Unknown=0, NotChecked=0, Total=5852 [2021-08-30 17:44:02,920 INFO L87 Difference]: Start difference. First operand 2338 states and 2667 transitions. Second operand has 77 states, 77 states have (on average 4.935064935064935) internal successors, (380), 76 states have internal predecessors, (380), 19 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-08-30 17:44:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:04,970 INFO L93 Difference]: Finished difference Result 2224 states and 2473 transitions. [2021-08-30 17:44:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-08-30 17:44:04,970 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 4.935064935064935) internal successors, (380), 76 states have internal predecessors, (380), 19 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 1369 [2021-08-30 17:44:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:04,975 INFO L225 Difference]: With dead ends: 2224 [2021-08-30 17:44:04,976 INFO L226 Difference]: Without dead ends: 1820 [2021-08-30 17:44:04,977 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2850 GetRequests, 2740 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2031.86ms TimeCoverageRelationStatistics Valid=2335, Invalid=9875, Unknown=0, NotChecked=0, Total=12210 [2021-08-30 17:44:04,977 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 1563 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3248 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 876.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.44ms SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1065.91ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:04,977 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1565 Valid, 63 Invalid, 3443 Unknown, 0 Unchecked, 9.44ms Time], IncrementalHoareTripleChecker [195 Valid, 3248 Invalid, 0 Unknown, 0 Unchecked, 1065.91ms Time] [2021-08-30 17:44:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2021-08-30 17:44:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1488. [2021-08-30 17:44:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1414 states have (on average 1.0643564356435644) internal successors, (1505), 1434 states have internal predecessors, (1505), 39 states have call successors, (39), 16 states have call predecessors, (39), 34 states have return successors, (96), 37 states have call predecessors, (96), 38 states have call successors, (96) [2021-08-30 17:44:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1640 transitions. [2021-08-30 17:44:04,997 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1640 transitions. Word has length 1369 [2021-08-30 17:44:04,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:04,998 INFO L470 AbstractCegarLoop]: Abstraction has 1488 states and 1640 transitions. [2021-08-30 17:44:04,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 4.935064935064935) internal successors, (380), 76 states have internal predecessors, (380), 19 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2021-08-30 17:44:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1640 transitions. [2021-08-30 17:44:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1526 [2021-08-30 17:44:05,012 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:05,013 INFO L513 BasicCegarLoop]: trace histogram [262, 261, 261, 261, 261, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:05,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:05,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:05,234 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:05,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1054791797, now seen corresponding path program 16 times [2021-08-30 17:44:05,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:05,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489505415] [2021-08-30 17:44:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:05,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1039 [2021-08-30 17:44:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1200 [2021-08-30 17:44:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 177088 backedges. 52106 proven. 5991 refuted. 0 times theorem prover too weak. 118991 trivial. 0 not checked. [2021-08-30 17:44:06,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:06,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489505415] [2021-08-30 17:44:06,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489505415] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:06,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658761954] [2021-08-30 17:44:06,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:44:06,046 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:06,047 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-30 17:44:06,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:44:06,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 3225 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-30 17:44:06,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 177088 backedges. 94446 proven. 2636 refuted. 0 times theorem prover too weak. 80006 trivial. 0 not checked. [2021-08-30 17:44:08,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 177088 backedges. 52012 proven. 8504 refuted. 0 times theorem prover too weak. 116572 trivial. 0 not checked. [2021-08-30 17:44:11,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658761954] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:11,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:11,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 41, 41] total 81 [2021-08-30 17:44:11,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147765346] [2021-08-30 17:44:11,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2021-08-30 17:44:11,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-08-30 17:44:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=5187, Unknown=0, NotChecked=0, Total=6480 [2021-08-30 17:44:11,230 INFO L87 Difference]: Start difference. First operand 1488 states and 1640 transitions. Second operand has 81 states, 81 states have (on average 4.925925925925926) internal successors, (399), 80 states have internal predecessors, (399), 19 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2021-08-30 17:44:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:13,049 INFO L93 Difference]: Finished difference Result 1536 states and 1720 transitions. [2021-08-30 17:44:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-08-30 17:44:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 4.925925925925926) internal successors, (399), 80 states have internal predecessors, (399), 19 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Word has length 1525 [2021-08-30 17:44:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:13,054 INFO L225 Difference]: With dead ends: 1536 [2021-08-30 17:44:13,054 INFO L226 Difference]: Without dead ends: 1527 [2021-08-30 17:44:13,056 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3167 GetRequests, 3046 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3581 ImplicationChecksByTransitivity, 2443.32ms TimeCoverageRelationStatistics Valid=3376, Invalid=11144, Unknown=0, NotChecked=0, Total=14520 [2021-08-30 17:44:13,056 INFO L928 BasicCegarLoop]: 20 mSDtfsCounter, 861 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 619.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.29ms SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 740.37ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:13,057 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 94 Invalid, 2352 Unknown, 0 Unchecked, 6.29ms Time], IncrementalHoareTripleChecker [101 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 740.37ms Time] [2021-08-30 17:44:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-08-30 17:44:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1491. [2021-08-30 17:44:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1416 states have (on average 1.0621468926553672) internal successors, (1504), 1437 states have internal predecessors, (1504), 39 states have call successors, (39), 16 states have call predecessors, (39), 35 states have return successors, (105), 37 states have call predecessors, (105), 38 states have call successors, (105) [2021-08-30 17:44:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1648 transitions. [2021-08-30 17:44:13,074 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1648 transitions. Word has length 1525 [2021-08-30 17:44:13,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:13,074 INFO L470 AbstractCegarLoop]: Abstraction has 1491 states and 1648 transitions. [2021-08-30 17:44:13,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 4.925925925925926) internal successors, (399), 80 states have internal predecessors, (399), 19 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2021-08-30 17:44:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1648 transitions. [2021-08-30 17:44:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1531 [2021-08-30 17:44:13,089 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:13,090 INFO L513 BasicCegarLoop]: trace histogram [263, 262, 262, 262, 262, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:13,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:13,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-08-30 17:44:13,305 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -389155478, now seen corresponding path program 17 times [2021-08-30 17:44:13,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:13,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687316336] [2021-08-30 17:44:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:13,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1205 [2021-08-30 17:44:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 178414 backedges. 66228 proven. 5508 refuted. 0 times theorem prover too weak. 106678 trivial. 0 not checked. [2021-08-30 17:44:14,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:14,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687316336] [2021-08-30 17:44:14,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687316336] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:14,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701382734] [2021-08-30 17:44:14,211 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:44:14,211 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:14,212 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:14,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-30 17:44:25,810 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2021-08-30 17:44:25,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:44:25,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 3728 conjuncts, 53 conjunts are in the unsatisfiable core [2021-08-30 17:44:25,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:44:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 178414 backedges. 96016 proven. 8001 refuted. 0 times theorem prover too weak. 74397 trivial. 0 not checked. [2021-08-30 17:44:28,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:44:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 178414 backedges. 69788 proven. 14854 refuted. 0 times theorem prover too weak. 93772 trivial. 0 not checked. [2021-08-30 17:44:32,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701382734] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:44:32,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:44:32,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 53] total 138 [2021-08-30 17:44:32,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791325835] [2021-08-30 17:44:32,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 138 states [2021-08-30 17:44:32,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:44:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2021-08-30 17:44:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2799, Invalid=16107, Unknown=0, NotChecked=0, Total=18906 [2021-08-30 17:44:32,762 INFO L87 Difference]: Start difference. First operand 1491 states and 1648 transitions. Second operand has 138 states, 138 states have (on average 4.891304347826087) internal successors, (675), 137 states have internal predecessors, (675), 26 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 25 states have call predecessors, (31), 26 states have call successors, (31) [2021-08-30 17:44:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:44:38,178 INFO L93 Difference]: Finished difference Result 1701 states and 1914 transitions. [2021-08-30 17:44:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-08-30 17:44:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 138 states have (on average 4.891304347826087) internal successors, (675), 137 states have internal predecessors, (675), 26 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 25 states have call predecessors, (31), 26 states have call successors, (31) Word has length 1530 [2021-08-30 17:44:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:44:38,183 INFO L225 Difference]: With dead ends: 1701 [2021-08-30 17:44:38,183 INFO L226 Difference]: Without dead ends: 1670 [2021-08-30 17:44:38,186 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3237 GetRequests, 3005 SyntacticMatches, 1 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16389 ImplicationChecksByTransitivity, 5819.93ms TimeCoverageRelationStatistics Valid=9484, Invalid=44572, Unknown=0, NotChecked=0, Total=54056 [2021-08-30 17:44:38,186 INFO L928 BasicCegarLoop]: 4 mSDtfsCounter, 1208 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6913 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2000.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.31ms SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 6913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2368.61ms IncrementalHoareTripleChecker+Time [2021-08-30 17:44:38,187 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1210 Valid, 67 Invalid, 7327 Unknown, 0 Unchecked, 18.31ms Time], IncrementalHoareTripleChecker [414 Valid, 6913 Invalid, 0 Unknown, 0 Unchecked, 2368.61ms Time] [2021-08-30 17:44:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-08-30 17:44:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1581. [2021-08-30 17:44:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1505 states have (on average 1.0465116279069768) internal successors, (1575), 1524 states have internal predecessors, (1575), 40 states have call successors, (40), 18 states have call predecessors, (40), 35 states have return successors, (92), 38 states have call predecessors, (92), 39 states have call successors, (92) [2021-08-30 17:44:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1707 transitions. [2021-08-30 17:44:38,205 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1707 transitions. Word has length 1530 [2021-08-30 17:44:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:44:38,206 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 1707 transitions. [2021-08-30 17:44:38,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 138 states, 138 states have (on average 4.891304347826087) internal successors, (675), 137 states have internal predecessors, (675), 26 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 25 states have call predecessors, (31), 26 states have call successors, (31) [2021-08-30 17:44:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1707 transitions. [2021-08-30 17:44:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2429 [2021-08-30 17:44:38,237 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:44:38,237 INFO L513 BasicCegarLoop]: trace histogram [425, 424, 424, 424, 424, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:44:38,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-08-30 17:44:38,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-08-30 17:44:38,450 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:44:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:44:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash 688958716, now seen corresponding path program 18 times [2021-08-30 17:44:38,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:44:38,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513744021] [2021-08-30 17:44:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:44:38,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:44:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:44:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:44:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:44:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:44:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:44:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:44:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:44:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:44:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:44:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:44:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:44:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:44:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:44:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:44:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:44:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:44:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:44:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:44:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:44:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1145 [2021-08-30 17:44:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1246 [2021-08-30 17:44:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1362 [2021-08-30 17:44:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1478 [2021-08-30 17:44:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1594 [2021-08-30 17:44:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1710 [2021-08-30 17:44:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1826 [2021-08-30 17:44:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1942 [2021-08-30 17:44:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2103 [2021-08-30 17:44:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:44:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 464645 backedges. 82058 proven. 19643 refuted. 0 times theorem prover too weak. 362944 trivial. 0 not checked. [2021-08-30 17:44:39,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:44:39,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513744021] [2021-08-30 17:44:39,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513744021] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:44:39,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250673890] [2021-08-30 17:44:39,619 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:44:39,619 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:44:39,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:44:39,621 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:44:39,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-30 17:45:26,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2021-08-30 17:45:26,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:45:26,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 4194 conjuncts, 39 conjunts are in the unsatisfiable core [2021-08-30 17:45:26,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 464645 backedges. 68765 proven. 23481 refuted. 0 times theorem prover too weak. 372399 trivial. 0 not checked. [2021-08-30 17:45:30,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:45:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 464645 backedges. 68640 proven. 23606 refuted. 0 times theorem prover too weak. 372399 trivial. 0 not checked. [2021-08-30 17:45:33,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250673890] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:45:33,565 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:45:33,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 38, 38] total 101 [2021-08-30 17:45:33,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92957086] [2021-08-30 17:45:33,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2021-08-30 17:45:33,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:45:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2021-08-30 17:45:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1342, Invalid=8758, Unknown=0, NotChecked=0, Total=10100 [2021-08-30 17:45:33,568 INFO L87 Difference]: Start difference. First operand 1581 states and 1707 transitions. Second operand has 101 states, 101 states have (on average 4.633663366336633) internal successors, (468), 98 states have internal predecessors, (468), 39 states have call successors, (44), 5 states have call predecessors, (44), 4 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-08-30 17:45:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:45:41,903 INFO L93 Difference]: Finished difference Result 3649 states and 4371 transitions. [2021-08-30 17:45:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2021-08-30 17:45:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 4.633663366336633) internal successors, (468), 98 states have internal predecessors, (468), 39 states have call successors, (44), 5 states have call predecessors, (44), 4 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) Word has length 2428 [2021-08-30 17:45:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:45:41,915 INFO L225 Difference]: With dead ends: 3649 [2021-08-30 17:45:41,915 INFO L226 Difference]: Without dead ends: 3632 [2021-08-30 17:45:41,918 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5127 GetRequests, 4852 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23977 ImplicationChecksByTransitivity, 8646.73ms TimeCoverageRelationStatistics Valid=12742, Invalid=63710, Unknown=0, NotChecked=0, Total=76452 [2021-08-30 17:45:41,919 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 3630 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1182.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3633 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.89ms SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1403.90ms IncrementalHoareTripleChecker+Time [2021-08-30 17:45:41,919 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3633 Valid, 384 Invalid, 4235 Unknown, 0 Unchecked, 13.89ms Time], IncrementalHoareTripleChecker [765 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 1403.90ms Time] [2021-08-30 17:45:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2021-08-30 17:45:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3401. [2021-08-30 17:45:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3175 states have (on average 1.0447244094488188) internal successors, (3317), 3215 states have internal predecessors, (3317), 162 states have call successors, (162), 25 states have call predecessors, (162), 63 states have return successors, (494), 160 states have call predecessors, (494), 161 states have call successors, (494) [2021-08-30 17:45:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 3973 transitions. [2021-08-30 17:45:41,973 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 3973 transitions. Word has length 2428 [2021-08-30 17:45:41,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:45:41,974 INFO L470 AbstractCegarLoop]: Abstraction has 3401 states and 3973 transitions. [2021-08-30 17:45:41,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 4.633663366336633) internal successors, (468), 98 states have internal predecessors, (468), 39 states have call successors, (44), 5 states have call predecessors, (44), 4 states have return successors, (41), 38 states have call predecessors, (41), 38 states have call successors, (41) [2021-08-30 17:45:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 3973 transitions. [2021-08-30 17:45:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2863 [2021-08-30 17:45:42,028 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:45:42,029 INFO L513 BasicCegarLoop]: trace histogram [503, 502, 502, 502, 502, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:45:42,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2021-08-30 17:45:42,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-08-30 17:45:42,245 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:45:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:45:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 165607438, now seen corresponding path program 19 times [2021-08-30 17:45:42,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:45:42,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565357645] [2021-08-30 17:45:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:45:42,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:45:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:45:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:45:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:45:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:45:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:45:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:45:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:45:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:45:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:45:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:45:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:45:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:45:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:45:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:45:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:42,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:45:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:45:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:45:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:45:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:45:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:45:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1256 [2021-08-30 17:45:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1362 [2021-08-30 17:45:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1468 [2021-08-30 17:45:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1574 [2021-08-30 17:45:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1680 [2021-08-30 17:45:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1796 [2021-08-30 17:45:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1912 [2021-08-30 17:45:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2028 [2021-08-30 17:45:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2144 [2021-08-30 17:45:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2260 [2021-08-30 17:45:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2376 [2021-08-30 17:45:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2537 [2021-08-30 17:45:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 650560 backedges. 98032 proven. 26406 refuted. 0 times theorem prover too weak. 526122 trivial. 0 not checked. [2021-08-30 17:45:43,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:45:43,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565357645] [2021-08-30 17:45:43,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565357645] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:45:43,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545268209] [2021-08-30 17:45:43,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:45:43,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:45:43,586 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:45:43,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-30 17:45:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:44,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 7110 conjuncts, 42 conjunts are in the unsatisfiable core [2021-08-30 17:45:44,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:45:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 650560 backedges. 336378 proven. 874 refuted. 0 times theorem prover too weak. 313308 trivial. 0 not checked. [2021-08-30 17:45:48,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:45:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 650560 backedges. 98136 proven. 26302 refuted. 0 times theorem prover too weak. 526122 trivial. 0 not checked. [2021-08-30 17:45:51,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545268209] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:45:51,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:45:51,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2021-08-30 17:45:51,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032396366] [2021-08-30 17:45:51,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2021-08-30 17:45:51,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:45:51,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-08-30 17:45:51,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=5415, Unknown=0, NotChecked=0, Total=6972 [2021-08-30 17:45:51,924 INFO L87 Difference]: Start difference. First operand 3401 states and 3973 transitions. Second operand has 84 states, 84 states have (on average 4.976190476190476) internal successors, (418), 83 states have internal predecessors, (418), 22 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2021-08-30 17:45:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:45:53,492 INFO L93 Difference]: Finished difference Result 3458 states and 4030 transitions. [2021-08-30 17:45:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-08-30 17:45:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 4.976190476190476) internal successors, (418), 83 states have internal predecessors, (418), 22 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) Word has length 2862 [2021-08-30 17:45:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:45:53,508 INFO L225 Difference]: With dead ends: 3458 [2021-08-30 17:45:53,509 INFO L226 Difference]: Without dead ends: 3431 [2021-08-30 17:45:53,510 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5871 GetRequests, 5745 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3885 ImplicationChecksByTransitivity, 2283.92ms TimeCoverageRelationStatistics Valid=3826, Invalid=11924, Unknown=0, NotChecked=0, Total=15750 [2021-08-30 17:45:53,510 INFO L928 BasicCegarLoop]: 23 mSDtfsCounter, 692 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 616.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.17ms SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 741.62ms IncrementalHoareTripleChecker+Time [2021-08-30 17:45:53,510 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 108 Invalid, 2407 Unknown, 0 Unchecked, 6.17ms Time], IncrementalHoareTripleChecker [87 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 741.62ms Time] [2021-08-30 17:45:53,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2021-08-30 17:45:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3401. [2021-08-30 17:45:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3175 states have (on average 1.0415748031496064) internal successors, (3307), 3215 states have internal predecessors, (3307), 162 states have call successors, (162), 25 states have call predecessors, (162), 63 states have return successors, (494), 160 states have call predecessors, (494), 161 states have call successors, (494) [2021-08-30 17:45:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 3963 transitions. [2021-08-30 17:45:53,567 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 3963 transitions. Word has length 2862 [2021-08-30 17:45:53,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:45:53,568 INFO L470 AbstractCegarLoop]: Abstraction has 3401 states and 3963 transitions. [2021-08-30 17:45:53,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.976190476190476) internal successors, (418), 83 states have internal predecessors, (418), 22 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 21 states have call predecessors, (23), 22 states have call successors, (23) [2021-08-30 17:45:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 3963 transitions. [2021-08-30 17:45:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2888 [2021-08-30 17:45:53,661 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:45:53,662 INFO L513 BasicCegarLoop]: trace histogram [508, 507, 507, 507, 507, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:45:53,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-08-30 17:45:53,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-08-30 17:45:53,862 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:45:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:45:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1578013751, now seen corresponding path program 20 times [2021-08-30 17:45:53,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:45:53,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605914505] [2021-08-30 17:45:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:45:53,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:45:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:45:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:45:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:45:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:45:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:45:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:45:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:45:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:45:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:45:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:45:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:45:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:45:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:45:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:45:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:45:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:45:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:45:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:45:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:45:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:45:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:54,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:45:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1372 [2021-08-30 17:45:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1483 [2021-08-30 17:45:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1594 [2021-08-30 17:45:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1705 [2021-08-30 17:45:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1821 [2021-08-30 17:45:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1937 [2021-08-30 17:45:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2053 [2021-08-30 17:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2169 [2021-08-30 17:45:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2285 [2021-08-30 17:45:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2401 [2021-08-30 17:45:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2562 [2021-08-30 17:45:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:45:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 663325 backedges. 101915 proven. 26190 refuted. 0 times theorem prover too weak. 535220 trivial. 0 not checked. [2021-08-30 17:45:55,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:45:55,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605914505] [2021-08-30 17:45:55,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605914505] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:45:55,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600129795] [2021-08-30 17:45:55,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:45:55,288 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:45:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:45:55,293 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:45:55,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-30 17:45:56,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:45:56,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:45:56,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 7170 conjuncts, 44 conjunts are in the unsatisfiable core [2021-08-30 17:45:56,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:46:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 663325 backedges. 352008 proven. 970 refuted. 0 times theorem prover too weak. 310347 trivial. 0 not checked. [2021-08-30 17:46:00,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 663325 backedges. 102025 proven. 26080 refuted. 0 times theorem prover too weak. 535220 trivial. 0 not checked. [2021-08-30 17:46:04,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600129795] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:04,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:04,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2021-08-30 17:46:04,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539786931] [2021-08-30 17:46:04,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2021-08-30 17:46:04,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:04,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-08-30 17:46:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1708, Invalid=5948, Unknown=0, NotChecked=0, Total=7656 [2021-08-30 17:46:04,137 INFO L87 Difference]: Start difference. First operand 3401 states and 3963 transitions. Second operand has 88 states, 88 states have (on average 4.9772727272727275) internal successors, (438), 87 states have internal predecessors, (438), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 22 states have call predecessors, (24), 23 states have call successors, (24) [2021-08-30 17:46:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:05,967 INFO L93 Difference]: Finished difference Result 2819 states and 3048 transitions. [2021-08-30 17:46:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-30 17:46:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 4.9772727272727275) internal successors, (438), 87 states have internal predecessors, (438), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 22 states have call predecessors, (24), 23 states have call successors, (24) Word has length 2887 [2021-08-30 17:46:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:05,974 INFO L225 Difference]: With dead ends: 2819 [2021-08-30 17:46:05,974 INFO L226 Difference]: Without dead ends: 2795 [2021-08-30 17:46:05,976 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5925 GetRequests, 5793 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2469.63ms TimeCoverageRelationStatistics Valid=4195, Invalid=13097, Unknown=0, NotChecked=0, Total=17292 [2021-08-30 17:46:05,977 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 738 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 764.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.67ms SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 928.50ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:05,980 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 169 Invalid, 2968 Unknown, 0 Unchecked, 7.67ms Time], IncrementalHoareTripleChecker [110 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 928.50ms Time] [2021-08-30 17:46:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2021-08-30 17:46:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2753. [2021-08-30 17:46:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2641 states have (on average 1.046951912154487) internal successors, (2765), 2669 states have internal predecessors, (2765), 60 states have call successors, (60), 25 states have call predecessors, (60), 51 states have return successors, (140), 58 states have call predecessors, (140), 59 states have call successors, (140) [2021-08-30 17:46:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 2965 transitions. [2021-08-30 17:46:06,011 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 2965 transitions. Word has length 2887 [2021-08-30 17:46:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:06,011 INFO L470 AbstractCegarLoop]: Abstraction has 2753 states and 2965 transitions. [2021-08-30 17:46:06,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 4.9772727272727275) internal successors, (438), 87 states have internal predecessors, (438), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 22 states have call predecessors, (24), 23 states have call successors, (24) [2021-08-30 17:46:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 2965 transitions. [2021-08-30 17:46:06,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2908 [2021-08-30 17:46:06,076 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:06,077 INFO L513 BasicCegarLoop]: trace histogram [512, 511, 511, 511, 511, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:06,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:06,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:06,297 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 872710851, now seen corresponding path program 21 times [2021-08-30 17:46:06,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:06,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581138028] [2021-08-30 17:46:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:06,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1493 [2021-08-30 17:46:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1609 [2021-08-30 17:46:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1725 [2021-08-30 17:46:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1841 [2021-08-30 17:46:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1957 [2021-08-30 17:46:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2073 [2021-08-30 17:46:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2189 [2021-08-30 17:46:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2305 [2021-08-30 17:46:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2421 [2021-08-30 17:46:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2582 [2021-08-30 17:46:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 673627 backedges. 105938 proven. 25605 refuted. 0 times theorem prover too weak. 542084 trivial. 0 not checked. [2021-08-30 17:46:07,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:07,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581138028] [2021-08-30 17:46:07,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581138028] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:07,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64742019] [2021-08-30 17:46:07,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:46:07,746 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:07,746 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:46:07,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-30 17:46:09,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2021-08-30 17:46:09,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:46:09,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 34 conjunts are in the unsatisfiable core [2021-08-30 17:46:09,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:46:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 673627 backedges. 118740 proven. 10966 refuted. 0 times theorem prover too weak. 543921 trivial. 0 not checked. [2021-08-30 17:46:13,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 673627 backedges. 118615 proven. 11091 refuted. 0 times theorem prover too weak. 543921 trivial. 0 not checked. [2021-08-30 17:46:17,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64742019] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:17,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:17,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 33, 33] total 110 [2021-08-30 17:46:17,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917768660] [2021-08-30 17:46:17,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2021-08-30 17:46:17,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2021-08-30 17:46:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=9730, Unknown=0, NotChecked=0, Total=11990 [2021-08-30 17:46:17,973 INFO L87 Difference]: Start difference. First operand 2753 states and 2965 transitions. Second operand has 110 states, 110 states have (on average 4.6454545454545455) internal successors, (511), 107 states have internal predecessors, (511), 29 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (30), 28 states have call predecessors, (30), 27 states have call successors, (30) [2021-08-30 17:46:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:27,496 INFO L93 Difference]: Finished difference Result 3886 states and 4211 transitions. [2021-08-30 17:46:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2021-08-30 17:46:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 4.6454545454545455) internal successors, (511), 107 states have internal predecessors, (511), 29 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (30), 28 states have call predecessors, (30), 27 states have call successors, (30) Word has length 2907 [2021-08-30 17:46:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:27,503 INFO L225 Difference]: With dead ends: 3886 [2021-08-30 17:46:27,503 INFO L226 Difference]: Without dead ends: 3764 [2021-08-30 17:46:27,507 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6118 GetRequests, 5814 SyntacticMatches, 1 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29420 ImplicationChecksByTransitivity, 10294.92ms TimeCoverageRelationStatistics Valid=17692, Invalid=75028, Unknown=0, NotChecked=0, Total=92720 [2021-08-30 17:46:27,507 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 3762 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 985 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1192.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3766 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 4304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.41ms SdHoareTripleChecker+Time, 985 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1413.70ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:27,508 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3766 Valid, 265 Invalid, 4304 Unknown, 0 Unchecked, 13.41ms Time], IncrementalHoareTripleChecker [985 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1413.70ms Time] [2021-08-30 17:46:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2021-08-30 17:46:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3502. [2021-08-30 17:46:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 3375 states have (on average 1.0429629629629629) internal successors, (3520), 3405 states have internal predecessors, (3520), 68 states have call successors, (68), 30 states have call predecessors, (68), 58 states have return successors, (158), 66 states have call predecessors, (158), 67 states have call successors, (158) [2021-08-30 17:46:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 3746 transitions. [2021-08-30 17:46:27,541 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 3746 transitions. Word has length 2907 [2021-08-30 17:46:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:27,542 INFO L470 AbstractCegarLoop]: Abstraction has 3502 states and 3746 transitions. [2021-08-30 17:46:27,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 4.6454545454545455) internal successors, (511), 107 states have internal predecessors, (511), 29 states have call successors, (33), 5 states have call predecessors, (33), 3 states have return successors, (30), 28 states have call predecessors, (30), 27 states have call successors, (30) [2021-08-30 17:46:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 3746 transitions. [2021-08-30 17:46:27,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2993 [2021-08-30 17:46:27,588 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:27,589 INFO L513 BasicCegarLoop]: trace histogram [529, 528, 528, 528, 528, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:27,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:27,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-08-30 17:46:27,805 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1975294154, now seen corresponding path program 22 times [2021-08-30 17:46:27,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:27,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782505529] [2021-08-30 17:46:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:27,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:46:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1619 [2021-08-30 17:46:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1740 [2021-08-30 17:46:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1861 [2021-08-30 17:46:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1982 [2021-08-30 17:46:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2103 [2021-08-30 17:46:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2224 [2021-08-30 17:46:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2345 [2021-08-30 17:46:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2506 [2021-08-30 17:46:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2667 [2021-08-30 17:46:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 718303 backedges. 112384 proven. 26175 refuted. 0 times theorem prover too weak. 579744 trivial. 0 not checked. [2021-08-30 17:46:29,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:29,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782505529] [2021-08-30 17:46:29,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782505529] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:29,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475183701] [2021-08-30 17:46:29,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-30 17:46:29,235 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:29,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:29,237 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:46:29,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-30 17:46:29,935 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-30 17:46:29,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:46:29,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 6255 conjuncts, 52 conjunts are in the unsatisfiable core [2021-08-30 17:46:29,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:46:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 718303 backedges. 388469 proven. 4301 refuted. 0 times theorem prover too weak. 325533 trivial. 0 not checked. [2021-08-30 17:46:34,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:46:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 718303 backedges. 112265 proven. 31667 refuted. 0 times theorem prover too weak. 574371 trivial. 0 not checked. [2021-08-30 17:46:38,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475183701] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:46:38,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:46:38,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 51, 51] total 101 [2021-08-30 17:46:38,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068443716] [2021-08-30 17:46:38,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2021-08-30 17:46:38,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:46:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2021-08-30 17:46:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2048, Invalid=8052, Unknown=0, NotChecked=0, Total=10100 [2021-08-30 17:46:38,436 INFO L87 Difference]: Start difference. First operand 3502 states and 3746 transitions. Second operand has 101 states, 101 states have (on average 4.9405940594059405) internal successors, (499), 100 states have internal predecessors, (499), 24 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-08-30 17:46:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:46:41,017 INFO L93 Difference]: Finished difference Result 3565 states and 3811 transitions. [2021-08-30 17:46:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-08-30 17:46:41,018 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 4.9405940594059405) internal successors, (499), 100 states have internal predecessors, (499), 24 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) Word has length 2992 [2021-08-30 17:46:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:46:41,026 INFO L225 Difference]: With dead ends: 3565 [2021-08-30 17:46:41,026 INFO L226 Difference]: Without dead ends: 3538 [2021-08-30 17:46:41,028 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6145 GetRequests, 5994 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5736 ImplicationChecksByTransitivity, 3591.96ms TimeCoverageRelationStatistics Valid=5276, Invalid=17374, Unknown=0, NotChecked=0, Total=22650 [2021-08-30 17:46:41,028 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 1085 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 3072 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 840.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.46ms SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1010.45ms IncrementalHoareTripleChecker+Time [2021-08-30 17:46:41,028 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1086 Valid, 115 Invalid, 3214 Unknown, 0 Unchecked, 8.46ms Time], IncrementalHoareTripleChecker [142 Valid, 3072 Invalid, 0 Unknown, 0 Unchecked, 1010.45ms Time] [2021-08-30 17:46:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2021-08-30 17:46:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3508. [2021-08-30 17:46:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3508 states, 3379 states have (on average 1.0393607576205979) internal successors, (3512), 3411 states have internal predecessors, (3512), 68 states have call successors, (68), 30 states have call predecessors, (68), 60 states have return successors, (162), 66 states have call predecessors, (162), 67 states have call successors, (162) [2021-08-30 17:46:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 3742 transitions. [2021-08-30 17:46:41,061 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 3742 transitions. Word has length 2992 [2021-08-30 17:46:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:46:41,062 INFO L470 AbstractCegarLoop]: Abstraction has 3508 states and 3742 transitions. [2021-08-30 17:46:41,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 4.9405940594059405) internal successors, (499), 100 states have internal predecessors, (499), 24 states have call successors, (28), 3 states have call predecessors, (28), 4 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2021-08-30 17:46:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 3742 transitions. [2021-08-30 17:46:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3028 [2021-08-30 17:46:41,142 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:46:41,142 INFO L513 BasicCegarLoop]: trace histogram [536, 535, 535, 535, 535, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:46:41,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2021-08-30 17:46:41,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:41,357 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:46:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:46:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1047804653, now seen corresponding path program 23 times [2021-08-30 17:46:41,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:46:41,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396169294] [2021-08-30 17:46:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:46:41,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:46:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:46:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:46:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:46:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:46:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:46:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:46:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:46:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:46:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:46:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:46:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:46:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:46:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:46:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:46:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:46:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:46:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:46:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:46:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:46:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:46:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:46:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:46:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:46:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:46:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1750 [2021-08-30 17:46:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1876 [2021-08-30 17:46:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2002 [2021-08-30 17:46:42,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2128 [2021-08-30 17:46:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2254 [2021-08-30 17:46:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2380 [2021-08-30 17:46:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2541 [2021-08-30 17:46:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2702 [2021-08-30 17:46:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:46:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 737119 backedges. 117542 proven. 25412 refuted. 0 times theorem prover too weak. 594165 trivial. 0 not checked. [2021-08-30 17:46:43,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:46:43,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396169294] [2021-08-30 17:46:43,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396169294] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:46:43,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106360766] [2021-08-30 17:46:43,029 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-30 17:46:43,029 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:46:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:46:43,030 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:46:43,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-30 17:47:05,331 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2021-08-30 17:47:05,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:47:05,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 6188 conjuncts, 54 conjunts are in the unsatisfiable core [2021-08-30 17:47:05,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:47:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 737119 backedges. 397321 proven. 8864 refuted. 0 times theorem prover too weak. 330934 trivial. 0 not checked. [2021-08-30 17:47:09,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:47:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 737119 backedges. 117348 proven. 38248 refuted. 0 times theorem prover too weak. 581523 trivial. 0 not checked. [2021-08-30 17:47:14,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106360766] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:47:14,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:47:14,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 54, 54] total 112 [2021-08-30 17:47:14,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129185610] [2021-08-30 17:47:14,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2021-08-30 17:47:14,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:47:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2021-08-30 17:47:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=10128, Unknown=0, NotChecked=0, Total=12432 [2021-08-30 17:47:14,465 INFO L87 Difference]: Start difference. First operand 3508 states and 3742 transitions. Second operand has 112 states, 112 states have (on average 4.901785714285714) internal successors, (549), 111 states have internal predecessors, (549), 25 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2021-08-30 17:47:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:47:17,003 INFO L93 Difference]: Finished difference Result 2998 states and 3167 transitions. [2021-08-30 17:47:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-08-30 17:47:17,003 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 4.901785714285714) internal successors, (549), 111 states have internal predecessors, (549), 25 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) Word has length 3027 [2021-08-30 17:47:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:47:17,009 INFO L225 Difference]: With dead ends: 2998 [2021-08-30 17:47:17,009 INFO L226 Difference]: Without dead ends: 2977 [2021-08-30 17:47:17,012 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6225 GetRequests, 6055 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7414 ImplicationChecksByTransitivity, 4074.35ms TimeCoverageRelationStatistics Valid=6388, Invalid=22342, Unknown=0, NotChecked=0, Total=28730 [2021-08-30 17:47:17,012 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 1217 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 754.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.48ms SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 906.18ms IncrementalHoareTripleChecker+Time [2021-08-30 17:47:17,012 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 100 Invalid, 2952 Unknown, 0 Unchecked, 7.48ms Time], IncrementalHoareTripleChecker [206 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 906.18ms Time] [2021-08-30 17:47:17,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2021-08-30 17:47:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2947. [2021-08-30 17:47:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2843 states have (on average 1.0344706296166022) internal successors, (2941), 2863 states have internal predecessors, (2941), 58 states have call successors, (58), 27 states have call predecessors, (58), 45 states have return successors, (106), 56 states have call predecessors, (106), 57 states have call successors, (106) [2021-08-30 17:47:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3105 transitions. [2021-08-30 17:47:17,036 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3105 transitions. Word has length 3027 [2021-08-30 17:47:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:47:17,037 INFO L470 AbstractCegarLoop]: Abstraction has 2947 states and 3105 transitions. [2021-08-30 17:47:17,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 4.901785714285714) internal successors, (549), 111 states have internal predecessors, (549), 25 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (28), 24 states have call predecessors, (28), 25 states have call successors, (28) [2021-08-30 17:47:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3105 transitions. [2021-08-30 17:47:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3058 [2021-08-30 17:47:17,101 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:47:17,102 INFO L513 BasicCegarLoop]: trace histogram [542, 541, 541, 541, 541, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:47:17,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2021-08-30 17:47:17,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:47:17,329 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:47:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:47:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1410653659, now seen corresponding path program 24 times [2021-08-30 17:47:17,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:47:17,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030706495] [2021-08-30 17:47:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:47:17,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:47:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:47:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:47:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:47:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:47:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:47:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:47:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:47:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:47:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:47:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:47:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:47:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:47:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:47:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:47:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:47:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:47:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:47:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:47:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:47:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:47:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:47:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:47:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:47:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:47:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:47:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1886 [2021-08-30 17:47:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2017 [2021-08-30 17:47:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2148 [2021-08-30 17:47:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2279 [2021-08-30 17:47:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2410 [2021-08-30 17:47:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2571 [2021-08-30 17:47:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2732 [2021-08-30 17:47:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 753442 backedges. 122885 proven. 24240 refuted. 0 times theorem prover too weak. 606317 trivial. 0 not checked. [2021-08-30 17:47:18,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:47:18,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030706495] [2021-08-30 17:47:18,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030706495] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:47:18,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181832099] [2021-08-30 17:47:18,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-30 17:47:18,930 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:47:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:47:18,931 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:47:18,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-30 17:47:39,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 63 check-sat command(s) [2021-08-30 17:47:39,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:47:39,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 5328 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-30 17:47:39,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:47:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 753442 backedges. 152275 proven. 7130 refuted. 0 times theorem prover too weak. 594037 trivial. 0 not checked. [2021-08-30 17:47:43,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:47:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 753442 backedges. 152150 proven. 7255 refuted. 0 times theorem prover too weak. 594037 trivial. 0 not checked. [2021-08-30 17:47:49,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181832099] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:47:49,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:47:49,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 40, 40] total 129 [2021-08-30 17:47:49,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739073855] [2021-08-30 17:47:49,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2021-08-30 17:47:49,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:47:49,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2021-08-30 17:47:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3356, Invalid=13156, Unknown=0, NotChecked=0, Total=16512 [2021-08-30 17:47:49,069 INFO L87 Difference]: Start difference. First operand 2947 states and 3105 transitions. Second operand has 129 states, 129 states have (on average 4.751937984496124) internal successors, (613), 127 states have internal predecessors, (613), 28 states have call successors, (32), 5 states have call predecessors, (32), 4 states have return successors, (29), 27 states have call predecessors, (29), 26 states have call successors, (29) [2021-08-30 17:47:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:47:58,271 INFO L93 Difference]: Finished difference Result 5137 states and 5605 transitions. [2021-08-30 17:47:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2021-08-30 17:47:58,272 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 4.751937984496124) internal successors, (613), 127 states have internal predecessors, (613), 28 states have call successors, (32), 5 states have call predecessors, (32), 4 states have return successors, (29), 27 states have call predecessors, (29), 26 states have call successors, (29) Word has length 3057 [2021-08-30 17:47:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:47:58,287 INFO L225 Difference]: With dead ends: 5137 [2021-08-30 17:47:58,288 INFO L226 Difference]: Without dead ends: 5119 [2021-08-30 17:47:58,293 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6415 GetRequests, 6102 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28842 ImplicationChecksByTransitivity, 10406.96ms TimeCoverageRelationStatistics Valid=18950, Invalid=79960, Unknown=0, NotChecked=0, Total=98910 [2021-08-30 17:47:58,294 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 3692 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1440.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3693 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.55ms SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1754.93ms IncrementalHoareTripleChecker+Time [2021-08-30 17:47:58,294 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [3693 Valid, 329 Invalid, 5261 Unknown, 0 Unchecked, 16.55ms Time], IncrementalHoareTripleChecker [747 Valid, 4514 Invalid, 0 Unknown, 0 Unchecked, 1754.93ms Time] [2021-08-30 17:47:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2021-08-30 17:47:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4217. [2021-08-30 17:47:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4217 states, 4083 states have (on average 1.0369826108253735) internal successors, (4234), 4114 states have internal predecessors, (4234), 70 states have call successors, (70), 34 states have call predecessors, (70), 63 states have return successors, (170), 68 states have call predecessors, (170), 69 states have call successors, (170) [2021-08-30 17:47:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 4474 transitions. [2021-08-30 17:47:58,336 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 4474 transitions. Word has length 3057 [2021-08-30 17:47:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:47:58,337 INFO L470 AbstractCegarLoop]: Abstraction has 4217 states and 4474 transitions. [2021-08-30 17:47:58,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 129 states, 129 states have (on average 4.751937984496124) internal successors, (613), 127 states have internal predecessors, (613), 28 states have call successors, (32), 5 states have call predecessors, (32), 4 states have return successors, (29), 27 states have call predecessors, (29), 26 states have call successors, (29) [2021-08-30 17:47:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 4474 transitions. [2021-08-30 17:47:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3098 [2021-08-30 17:47:58,420 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:47:58,421 INFO L513 BasicCegarLoop]: trace histogram [550, 549, 549, 549, 549, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:47:58,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-08-30 17:47:58,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2021-08-30 17:47:58,641 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:47:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:47:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1646739983, now seen corresponding path program 25 times [2021-08-30 17:47:58,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:47:58,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139364473] [2021-08-30 17:47:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:47:58,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:47:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:47:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:47:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:47:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:47:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:47:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:47:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:47:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:47:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:47:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:47:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:47:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:47:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:47:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:47:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:47:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:47:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:47:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:47:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:47:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:47:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:47:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:47:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:47:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:47:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:47:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:47:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:47:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2027 [2021-08-30 17:48:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2163 [2021-08-30 17:48:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2299 [2021-08-30 17:48:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2435 [2021-08-30 17:48:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2596 [2021-08-30 17:48:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2762 [2021-08-30 17:48:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 775486 backedges. 128914 proven. 23007 refuted. 0 times theorem prover too weak. 623565 trivial. 0 not checked. [2021-08-30 17:48:00,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:48:00,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139364473] [2021-08-30 17:48:00,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139364473] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:48:00,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461273540] [2021-08-30 17:48:00,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-30 17:48:00,328 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:48:00,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:48:00,329 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:48:00,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2021-08-30 17:48:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:01,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 7674 conjuncts, 54 conjunts are in the unsatisfiable core [2021-08-30 17:48:01,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 775486 backedges. 401838 proven. 1525 refuted. 0 times theorem prover too weak. 372123 trivial. 0 not checked. [2021-08-30 17:48:05,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:48:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 775486 backedges. 129054 proven. 22867 refuted. 0 times theorem prover too weak. 623565 trivial. 0 not checked. [2021-08-30 17:48:10,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461273540] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:48:10,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:48:10,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2021-08-30 17:48:10,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874115278] [2021-08-30 17:48:10,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2021-08-30 17:48:10,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:48:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2021-08-30 17:48:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2568, Invalid=8988, Unknown=0, NotChecked=0, Total=11556 [2021-08-30 17:48:10,017 INFO L87 Difference]: Start difference. First operand 4217 states and 4474 transitions. Second operand has 108 states, 108 states have (on average 4.981481481481482) internal successors, (538), 107 states have internal predecessors, (538), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-08-30 17:48:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:48:11,979 INFO L93 Difference]: Finished difference Result 4286 states and 4564 transitions. [2021-08-30 17:48:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-08-30 17:48:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 4.981481481481482) internal successors, (538), 107 states have internal predecessors, (538), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) Word has length 3097 [2021-08-30 17:48:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:48:11,995 INFO L225 Difference]: With dead ends: 4286 [2021-08-30 17:48:11,995 INFO L226 Difference]: Without dead ends: 4268 [2021-08-30 17:48:11,998 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6365 GetRequests, 6203 SyntacticMatches, 2 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6615 ImplicationChecksByTransitivity, 3614.98ms TimeCoverageRelationStatistics Valid=6295, Invalid=19787, Unknown=0, NotChecked=0, Total=26082 [2021-08-30 17:48:11,998 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 853 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 583.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.53ms SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 707.49ms IncrementalHoareTripleChecker+Time [2021-08-30 17:48:11,998 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 98 Invalid, 2006 Unknown, 0 Unchecked, 5.53ms Time], IncrementalHoareTripleChecker [112 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 707.49ms Time] [2021-08-30 17:48:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2021-08-30 17:48:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4220. [2021-08-30 17:48:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4085 states have (on average 1.0340269277845777) internal successors, (4224), 4117 states have internal predecessors, (4224), 70 states have call successors, (70), 34 states have call predecessors, (70), 64 states have return successors, (173), 68 states have call predecessors, (173), 69 states have call successors, (173) [2021-08-30 17:48:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 4467 transitions. [2021-08-30 17:48:12,038 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 4467 transitions. Word has length 3097 [2021-08-30 17:48:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:48:12,038 INFO L470 AbstractCegarLoop]: Abstraction has 4220 states and 4467 transitions. [2021-08-30 17:48:12,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 4.981481481481482) internal successors, (538), 107 states have internal predecessors, (538), 28 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29) [2021-08-30 17:48:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 4467 transitions. [2021-08-30 17:48:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3118 [2021-08-30 17:48:12,089 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:48:12,089 INFO L513 BasicCegarLoop]: trace histogram [554, 553, 553, 553, 553, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:48:12,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2021-08-30 17:48:12,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-08-30 17:48:12,290 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:48:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:48:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -562943003, now seen corresponding path program 26 times [2021-08-30 17:48:12,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:48:12,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105491273] [2021-08-30 17:48:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:48:12,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:48:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:48:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:48:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:48:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:48:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:48:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:48:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:48:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:48:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:48:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:48:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:48:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:48:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:48:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:48:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:48:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:48:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:48:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:48:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:48:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:48:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:48:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:48:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:48:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:48:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:48:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:48:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:48:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2173 [2021-08-30 17:48:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:13,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2314 [2021-08-30 17:48:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2455 [2021-08-30 17:48:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2616 [2021-08-30 17:48:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2782 [2021-08-30 17:48:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 786628 backedges. 134672 proven. 20942 refuted. 0 times theorem prover too weak. 631014 trivial. 0 not checked. [2021-08-30 17:48:14,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:48:14,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105491273] [2021-08-30 17:48:14,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105491273] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:48:14,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107743692] [2021-08-30 17:48:14,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-30 17:48:14,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:48:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:48:14,075 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:48:14,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-08-30 17:48:14,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-30 17:48:14,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:48:14,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 7722 conjuncts, 56 conjunts are in the unsatisfiable core [2021-08-30 17:48:14,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 786628 backedges. 390058 proven. 1651 refuted. 0 times theorem prover too weak. 394919 trivial. 0 not checked. [2021-08-30 17:48:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:48:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 786628 backedges. 134818 proven. 20796 refuted. 0 times theorem prover too weak. 631014 trivial. 0 not checked. [2021-08-30 17:48:24,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107743692] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:48:24,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:48:24,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2021-08-30 17:48:24,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715469334] [2021-08-30 17:48:24,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2021-08-30 17:48:24,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:48:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2021-08-30 17:48:24,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2761, Invalid=9671, Unknown=0, NotChecked=0, Total=12432 [2021-08-30 17:48:24,302 INFO L87 Difference]: Start difference. First operand 4220 states and 4467 transitions. Second operand has 112 states, 112 states have (on average 4.982142857142857) internal successors, (558), 111 states have internal predecessors, (558), 29 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (30), 28 states have call predecessors, (30), 29 states have call successors, (30) [2021-08-30 17:48:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:48:26,391 INFO L93 Difference]: Finished difference Result 4286 states and 4545 transitions. [2021-08-30 17:48:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-08-30 17:48:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 4.982142857142857) internal successors, (558), 111 states have internal predecessors, (558), 29 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (30), 28 states have call predecessors, (30), 29 states have call successors, (30) Word has length 3117 [2021-08-30 17:48:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:48:26,399 INFO L225 Difference]: With dead ends: 4286 [2021-08-30 17:48:26,400 INFO L226 Difference]: Without dead ends: 4268 [2021-08-30 17:48:26,402 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6409 GetRequests, 6241 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7140 ImplicationChecksByTransitivity, 3931.77ms TimeCoverageRelationStatistics Valid=6766, Invalid=21290, Unknown=0, NotChecked=0, Total=28056 [2021-08-30 17:48:26,403 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 969 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 615.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.09ms SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 749.24ms IncrementalHoareTripleChecker+Time [2021-08-30 17:48:26,403 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [970 Valid, 279 Invalid, 2231 Unknown, 0 Unchecked, 6.09ms Time], IncrementalHoareTripleChecker [89 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 749.24ms Time] [2021-08-30 17:48:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2021-08-30 17:48:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4220. [2021-08-30 17:48:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 4085 states have (on average 1.0310893512851897) internal successors, (4212), 4117 states have internal predecessors, (4212), 70 states have call successors, (70), 34 states have call predecessors, (70), 64 states have return successors, (166), 68 states have call predecessors, (166), 69 states have call successors, (166) [2021-08-30 17:48:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 4448 transitions. [2021-08-30 17:48:26,441 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 4448 transitions. Word has length 3117 [2021-08-30 17:48:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:48:26,442 INFO L470 AbstractCegarLoop]: Abstraction has 4220 states and 4448 transitions. [2021-08-30 17:48:26,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 4.982142857142857) internal successors, (558), 111 states have internal predecessors, (558), 29 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (30), 28 states have call predecessors, (30), 29 states have call successors, (30) [2021-08-30 17:48:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 4448 transitions. [2021-08-30 17:48:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3133 [2021-08-30 17:48:26,522 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:48:26,523 INFO L513 BasicCegarLoop]: trace histogram [557, 556, 556, 556, 556, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:48:26,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2021-08-30 17:48:26,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-08-30 17:48:26,735 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:48:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:48:26,736 INFO L82 PathProgramCache]: Analyzing trace with hash 819328432, now seen corresponding path program 27 times [2021-08-30 17:48:26,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:48:26,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535594120] [2021-08-30 17:48:26,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:48:26,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:48:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-30 17:48:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-30 17:48:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-30 17:48:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-30 17:48:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-30 17:48:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-08-30 17:48:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-08-30 17:48:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-08-30 17:48:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2021-08-30 17:48:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2021-08-30 17:48:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 376 [2021-08-30 17:48:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2021-08-30 17:48:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2021-08-30 17:48:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 589 [2021-08-30 17:48:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 670 [2021-08-30 17:48:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 756 [2021-08-30 17:48:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 847 [2021-08-30 17:48:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 943 [2021-08-30 17:48:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1044 [2021-08-30 17:48:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1150 [2021-08-30 17:48:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1261 [2021-08-30 17:48:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1377 [2021-08-30 17:48:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1498 [2021-08-30 17:48:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1624 [2021-08-30 17:48:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1755 [2021-08-30 17:48:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1891 [2021-08-30 17:48:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2032 [2021-08-30 17:48:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2178 [2021-08-30 17:48:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2324 [2021-08-30 17:48:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2470 [2021-08-30 17:48:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2631 [2021-08-30 17:48:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2797 [2021-08-30 17:48:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-30 17:48:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 795037 backedges. 140660 proven. 18378 refuted. 0 times theorem prover too weak. 635999 trivial. 0 not checked. [2021-08-30 17:48:28,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-30 17:48:28,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535594120] [2021-08-30 17:48:28,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535594120] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-30 17:48:28,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159240838] [2021-08-30 17:48:28,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-30 17:48:28,564 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-30 17:48:28,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-30 17:48:28,565 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-30 17:48:28,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2021-08-30 17:48:43,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2021-08-30 17:48:43,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-30 17:48:43,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 4860 conjuncts, 41 conjunts are in the unsatisfiable core [2021-08-30 17:48:43,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-30 17:48:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 795037 backedges. 138097 proven. 18998 refuted. 0 times theorem prover too weak. 637942 trivial. 0 not checked. [2021-08-30 17:48:48,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-30 17:48:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 795037 backedges. 137972 proven. 19123 refuted. 0 times theorem prover too weak. 637942 trivial. 0 not checked. [2021-08-30 17:48:53,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159240838] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-30 17:48:53,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-30 17:48:53,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 40, 40] total 132 [2021-08-30 17:48:53,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038342196] [2021-08-30 17:48:53,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-08-30 17:48:53,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-30 17:48:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-08-30 17:48:53,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3088, Invalid=14204, Unknown=0, NotChecked=0, Total=17292 [2021-08-30 17:48:53,197 INFO L87 Difference]: Start difference. First operand 4220 states and 4448 transitions. Second operand has 132 states, 132 states have (on average 4.742424242424242) internal successors, (626), 129 states have internal predecessors, (626), 34 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2021-08-30 17:49:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-30 17:49:03,758 INFO L93 Difference]: Finished difference Result 7948 states and 8491 transitions. [2021-08-30 17:49:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2021-08-30 17:49:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 4.742424242424242) internal successors, (626), 129 states have internal predecessors, (626), 34 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) Word has length 3132 [2021-08-30 17:49:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-30 17:49:03,772 INFO L225 Difference]: With dead ends: 7948 [2021-08-30 17:49:03,772 INFO L226 Difference]: Without dead ends: 7930 [2021-08-30 17:49:03,777 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6598 GetRequests, 6253 SyntacticMatches, 2 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36606 ImplicationChecksByTransitivity, 11975.23ms TimeCoverageRelationStatistics Valid=21421, Invalid=97259, Unknown=0, NotChecked=0, Total=118680 [2021-08-30 17:49:03,778 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 4170 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 4086 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1376.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4172 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.15ms SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 4086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1635.55ms IncrementalHoareTripleChecker+Time [2021-08-30 17:49:03,778 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4172 Valid, 338 Invalid, 4955 Unknown, 0 Unchecked, 16.15ms Time], IncrementalHoareTripleChecker [869 Valid, 4086 Invalid, 0 Unknown, 0 Unchecked, 1635.55ms Time] [2021-08-30 17:49:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7930 states. [2021-08-30 17:49:03,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7930 to 6614. [2021-08-30 17:49:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6402 states have (on average 1.0268666041861918) internal successors, (6574), 6459 states have internal predecessors, (6574), 109 states have call successors, (109), 47 states have call predecessors, (109), 102 states have return successors, (354), 107 states have call predecessors, (354), 108 states have call successors, (354) [2021-08-30 17:49:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 7037 transitions. [2021-08-30 17:49:03,851 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 7037 transitions. Word has length 3132 [2021-08-30 17:49:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-30 17:49:03,852 INFO L470 AbstractCegarLoop]: Abstraction has 6614 states and 7037 transitions. [2021-08-30 17:49:03,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 4.742424242424242) internal successors, (626), 129 states have internal predecessors, (626), 34 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2021-08-30 17:49:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 7037 transitions. [2021-08-30 17:49:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3148 [2021-08-30 17:49:03,907 INFO L505 BasicCegarLoop]: Found error trace [2021-08-30 17:49:03,908 INFO L513 BasicCegarLoop]: trace histogram [560, 559, 559, 559, 559, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2021-08-30 17:49:03,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2021-08-30 17:49:04,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-08-30 17:49:04,125 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting fooErr0ASSERT_VIOLATIONARRAY_INDEX === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION (and 3 more)] === [2021-08-30 17:49:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-30 17:49:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash -486718779, now seen corresponding path program 28 times [2021-08-30 17:49:04,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-30 17:49:04,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224894164] [2021-08-30 17:49:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-30 17:49:04,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-30 17:49:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:49:05,911 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-30 17:49:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-30 17:49:08,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-30 17:49:08,044 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-30 17:49:08,045 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location fooErr0ASSERT_VIOLATIONARRAY_INDEX (7 of 8 remaining) [2021-08-30 17:49:08,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr1REQUIRES_VIOLATION (6 of 8 remaining) [2021-08-30 17:49:08,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location fooErr2REQUIRES_VIOLATION (5 of 8 remaining) [2021-08-30 17:49:08,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION (4 of 8 remaining) [2021-08-30 17:49:08,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION (3 of 8 remaining) [2021-08-30 17:49:08,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION (2 of 8 remaining) [2021-08-30 17:49:08,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION (1 of 8 remaining) [2021-08-30 17:49:08,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4ENSURES_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2021-08-30 17:49:08,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-30 17:49:08,053 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-30 17:49:08,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 05:49:08 BoogieIcfgContainer [2021-08-30 17:49:08,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-30 17:49:08,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-30 17:49:08,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-30 17:49:08,337 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-30 17:49:08,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:42:24" (3/4) ... [2021-08-30 17:49:08,339 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-30 17:49:08,642 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-30 17:49:08,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-30 17:49:08,643 INFO L158 Benchmark]: Toolchain (without parser) took 404314.75ms. Allocated memory was 46.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 30.4MB in the beginning and 244.5MB in the end (delta: -214.1MB). Peak memory consumption was 857.0MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,643 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 46.1MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-30 17:49:08,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.91ms. Allocated memory is still 46.1MB. Free memory was 30.2MB in the beginning and 21.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,643 INFO L158 Benchmark]: Boogie Preprocessor took 59.53ms. Allocated memory is still 46.1MB. Free memory was 21.3MB in the beginning and 28.8MB in the end (delta: -7.6MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,643 INFO L158 Benchmark]: RCFGBuilder took 226.73ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 29.0MB in the end (delta: -336.9kB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,644 INFO L158 Benchmark]: TraceAbstraction took 403550.11ms. Allocated memory was 46.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 28.6MB in the beginning and 335.5MB in the end (delta: -306.9MB). Peak memory consumption was 909.8MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,644 INFO L158 Benchmark]: Witness Printer took 305.68ms. Allocated memory is still 1.1GB. Free memory was 334.4MB in the beginning and 244.5MB in the end (delta: 89.9MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2021-08-30 17:49:08,647 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.46ms. Allocated memory is still 46.1MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 30.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 167.91ms. Allocated memory is still 46.1MB. Free memory was 30.2MB in the beginning and 21.3MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.53ms. Allocated memory is still 46.1MB. Free memory was 21.3MB in the beginning and 28.8MB in the end (delta: -7.6MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * RCFGBuilder took 226.73ms. Allocated memory is still 46.1MB. Free memory was 28.7MB in the beginning and 29.0MB in the end (delta: -336.9kB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 403550.11ms. Allocated memory was 46.1MB in the beginning and 1.1GB in the end (delta: 1.1GB). Free memory was 28.6MB in the beginning and 335.5MB in the end (delta: -306.9MB). Peak memory consumption was 909.8MB. Max. memory is 16.1GB. * Witness Printer took 305.68ms. Allocated memory is still 1.1GB. Free memory was 334.4MB in the beginning and 244.5MB in the end (delta: 89.9MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L24] int i, b[32]; [L25] char mask[32]; [L26] i = 0 VAL [b={34:0}, i=0, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=0, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=1, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=0, size=1] [L18] EXPR b[i] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=140, i=0, size=1] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L17] COND TRUE i <= size VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR a[i] VAL [\old(size)=1, b={33:0}, b={33:0}, i=1, size=1] [L18] EXPR b[i] VAL [\old(size)=1, b={33:0}, b={33:0}, b[i]=138, i=1, size=1] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L17] COND FALSE !(i <= size) VAL [\old(size)=1, b={33:0}, b={33:0}, i=2, size=1] [L20] return i; VAL [\old(size)=1, \result=2, b={33:0}, b={33:0}, i=2, size=1] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=2, i=0, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=2, i=0, mask={33:0}] [L26] i++ VAL [b={34:0}, i=1, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=1, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=2, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=0, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=140, i=0, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=1, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=138, i=1, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L17] COND TRUE i <= size VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR a[i] VAL [\old(size)=2, b={33:0}, b={33:0}, i=2, size=2] [L18] EXPR b[i] VAL [\old(size)=2, b={33:0}, b={33:0}, b[i]=142, i=2, size=2] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L17] COND FALSE !(i <= size) VAL [\old(size)=2, b={33:0}, b={33:0}, i=3, size=2] [L20] return i; VAL [\old(size)=2, \result=3, b={33:0}, b={33:0}, i=3, size=2] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=3, i=1, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=3, i=1, mask={33:0}] [L26] i++ VAL [b={34:0}, i=2, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=2, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=3, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=0, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=140, i=0, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=1, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=138, i=1, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=2, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=142, i=2, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L17] COND TRUE i <= size VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR a[i] VAL [\old(size)=3, b={33:0}, b={33:0}, i=3, size=3] [L18] EXPR b[i] VAL [\old(size)=3, b={33:0}, b={33:0}, b[i]=144, i=3, size=3] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L17] COND FALSE !(i <= size) VAL [\old(size)=3, b={33:0}, b={33:0}, i=4, size=3] [L20] return i; VAL [\old(size)=3, \result=4, b={33:0}, b={33:0}, i=4, size=3] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=4, i=2, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=4, i=2, mask={33:0}] [L26] i++ VAL [b={34:0}, i=3, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=3, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=4, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=0, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=140, i=0, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=1, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=138, i=1, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=2, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=142, i=2, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=3, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=144, i=3, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L17] COND TRUE i <= size VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR a[i] VAL [\old(size)=4, b={33:0}, b={33:0}, i=4, size=4] [L18] EXPR b[i] VAL [\old(size)=4, b={33:0}, b={33:0}, b[i]=143, i=4, size=4] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L17] COND FALSE !(i <= size) VAL [\old(size)=4, b={33:0}, b={33:0}, i=5, size=4] [L20] return i; VAL [\old(size)=4, \result=5, b={33:0}, b={33:0}, i=5, size=4] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=5, i=3, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=5, i=3, mask={33:0}] [L26] i++ VAL [b={34:0}, i=4, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=4, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=5, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=0, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=140, i=0, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=1, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=138, i=1, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=2, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=142, i=2, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=3, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=144, i=3, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=4, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=143, i=4, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L17] COND TRUE i <= size VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR a[i] VAL [\old(size)=5, b={33:0}, b={33:0}, i=5, size=5] [L18] EXPR b[i] VAL [\old(size)=5, b={33:0}, b={33:0}, b[i]=153, i=5, size=5] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L17] COND FALSE !(i <= size) VAL [\old(size)=5, b={33:0}, b={33:0}, i=6, size=5] [L20] return i; VAL [\old(size)=5, \result=6, b={33:0}, b={33:0}, i=6, size=5] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=6, i=4, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=6, i=4, mask={33:0}] [L26] i++ VAL [b={34:0}, i=5, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=5, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=6, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=0, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=140, i=0, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=1, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=138, i=1, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=2, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=142, i=2, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=3, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=144, i=3, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=4, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=143, i=4, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=5, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=153, i=5, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L17] COND TRUE i <= size VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR a[i] VAL [\old(size)=6, b={33:0}, b={33:0}, i=6, size=6] [L18] EXPR b[i] VAL [\old(size)=6, b={33:0}, b={33:0}, b[i]=149, i=6, size=6] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L17] COND FALSE !(i <= size) VAL [\old(size)=6, b={33:0}, b={33:0}, i=7, size=6] [L20] return i; VAL [\old(size)=6, \result=7, b={33:0}, b={33:0}, i=7, size=6] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=7, i=5, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=7, i=5, mask={33:0}] [L26] i++ VAL [b={34:0}, i=6, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=6, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=7, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=0, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=140, i=0, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=1, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=138, i=1, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=2, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=142, i=2, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=3, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=144, i=3, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=4, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=143, i=4, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=5, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=153, i=5, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=6, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=149, i=6, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L17] COND TRUE i <= size VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR a[i] VAL [\old(size)=7, b={33:0}, b={33:0}, i=7, size=7] [L18] EXPR b[i] VAL [\old(size)=7, b={33:0}, b={33:0}, b[i]=133, i=7, size=7] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L17] COND FALSE !(i <= size) VAL [\old(size)=7, b={33:0}, b={33:0}, i=8, size=7] [L20] return i; VAL [\old(size)=7, \result=8, b={33:0}, b={33:0}, i=8, size=7] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=8, i=6, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=8, i=6, mask={33:0}] [L26] i++ VAL [b={34:0}, i=7, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=7, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=8, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=0, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=140, i=0, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=1, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=138, i=1, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=2, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=142, i=2, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=3, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=144, i=3, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=4, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=143, i=4, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=5, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=153, i=5, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=6, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=149, i=6, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=7, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=133, i=7, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L17] COND TRUE i <= size VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR a[i] VAL [\old(size)=8, b={33:0}, b={33:0}, i=8, size=8] [L18] EXPR b[i] VAL [\old(size)=8, b={33:0}, b={33:0}, b[i]=151, i=8, size=8] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L17] COND FALSE !(i <= size) VAL [\old(size)=8, b={33:0}, b={33:0}, i=9, size=8] [L20] return i; VAL [\old(size)=8, \result=9, b={33:0}, b={33:0}, i=9, size=8] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=9, i=7, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=9, i=7, mask={33:0}] [L26] i++ VAL [b={34:0}, i=8, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=8, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=9, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=0, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=140, i=0, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=1, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=138, i=1, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=2, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=142, i=2, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=3, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=144, i=3, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=4, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=143, i=4, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=5, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=153, i=5, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=6, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=149, i=6, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=7, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=133, i=7, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=8, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=151, i=8, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L17] COND TRUE i <= size VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR a[i] VAL [\old(size)=9, b={33:0}, b={33:0}, i=9, size=9] [L18] EXPR b[i] VAL [\old(size)=9, b={33:0}, b={33:0}, b[i]=162, i=9, size=9] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L17] COND FALSE !(i <= size) VAL [\old(size)=9, b={33:0}, b={33:0}, i=10, size=9] [L20] return i; VAL [\old(size)=9, \result=10, b={33:0}, b={33:0}, i=10, size=9] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=10, i=8, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=10, i=8, mask={33:0}] [L26] i++ VAL [b={34:0}, i=9, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=9, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=10, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=0, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=140, i=0, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=1, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=138, i=1, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=2, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=142, i=2, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=3, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=144, i=3, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=4, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=143, i=4, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=5, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=153, i=5, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=6, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=149, i=6, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=7, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=133, i=7, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=8, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=151, i=8, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=9, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=162, i=9, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L17] COND TRUE i <= size VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR a[i] VAL [\old(size)=10, b={33:0}, b={33:0}, i=10, size=10] [L18] EXPR b[i] VAL [\old(size)=10, b={33:0}, b={33:0}, b[i]=130, i=10, size=10] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L17] COND FALSE !(i <= size) VAL [\old(size)=10, b={33:0}, b={33:0}, i=11, size=10] [L20] return i; VAL [\old(size)=10, \result=11, b={33:0}, b={33:0}, i=11, size=10] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=11, i=9, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=11, i=9, mask={33:0}] [L26] i++ VAL [b={34:0}, i=10, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=10, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=11, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=0, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=140, i=0, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=1, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=138, i=1, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=2, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=142, i=2, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=3, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=144, i=3, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=4, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=143, i=4, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=5, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=153, i=5, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=6, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=149, i=6, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=7, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=133, i=7, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=8, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=151, i=8, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=9, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=162, i=9, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=10, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=130, i=10, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L17] COND TRUE i <= size VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR a[i] VAL [\old(size)=11, b={33:0}, b={33:0}, i=11, size=11] [L18] EXPR b[i] VAL [\old(size)=11, b={33:0}, b={33:0}, b[i]=146, i=11, size=11] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L17] COND FALSE !(i <= size) VAL [\old(size)=11, b={33:0}, b={33:0}, i=12, size=11] [L20] return i; VAL [\old(size)=11, \result=12, b={33:0}, b={33:0}, i=12, size=11] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=12, i=10, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=12, i=10, mask={33:0}] [L26] i++ VAL [b={34:0}, i=11, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=11, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=12, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=0, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=140, i=0, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=1, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=138, i=1, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=2, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=142, i=2, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=3, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=144, i=3, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=4, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=143, i=4, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=5, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=153, i=5, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=6, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=149, i=6, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=7, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=133, i=7, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=8, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=151, i=8, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=9, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=162, i=9, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=10, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=130, i=10, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=11, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=146, i=11, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L17] COND TRUE i <= size VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR a[i] VAL [\old(size)=12, b={33:0}, b={33:0}, i=12, size=12] [L18] EXPR b[i] VAL [\old(size)=12, b={33:0}, b={33:0}, b[i]=159, i=12, size=12] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L17] COND FALSE !(i <= size) VAL [\old(size)=12, b={33:0}, b={33:0}, i=13, size=12] [L20] return i; VAL [\old(size)=12, \result=13, b={33:0}, b={33:0}, i=13, size=12] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=13, i=11, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=13, i=11, mask={33:0}] [L26] i++ VAL [b={34:0}, i=12, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=12, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=13, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=0, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=140, i=0, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=1, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=138, i=1, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=2, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=142, i=2, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=3, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=144, i=3, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=4, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=143, i=4, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=5, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=153, i=5, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=6, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=149, i=6, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=7, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=133, i=7, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=8, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=151, i=8, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=9, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=162, i=9, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=10, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=130, i=10, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=11, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=146, i=11, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=12, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=159, i=12, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L17] COND TRUE i <= size VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR a[i] VAL [\old(size)=13, b={33:0}, b={33:0}, i=13, size=13] [L18] EXPR b[i] VAL [\old(size)=13, b={33:0}, b={33:0}, b[i]=131, i=13, size=13] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L17] COND FALSE !(i <= size) VAL [\old(size)=13, b={33:0}, b={33:0}, i=14, size=13] [L20] return i; VAL [\old(size)=13, \result=14, b={33:0}, b={33:0}, i=14, size=13] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=14, i=12, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=14, i=12, mask={33:0}] [L26] i++ VAL [b={34:0}, i=13, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=13, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=14, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=0, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=140, i=0, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=1, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=138, i=1, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=2, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=142, i=2, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=3, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=144, i=3, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=4, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=143, i=4, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=5, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=153, i=5, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=6, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=149, i=6, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=7, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=133, i=7, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=8, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=151, i=8, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=9, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=162, i=9, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=10, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=130, i=10, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=11, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=146, i=11, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=12, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=159, i=12, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=13, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=131, i=13, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L17] COND TRUE i <= size VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR a[i] VAL [\old(size)=14, b={33:0}, b={33:0}, i=14, size=14] [L18] EXPR b[i] VAL [\old(size)=14, b={33:0}, b={33:0}, b[i]=148, i=14, size=14] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L17] COND FALSE !(i <= size) VAL [\old(size)=14, b={33:0}, b={33:0}, i=15, size=14] [L20] return i; VAL [\old(size)=14, \result=15, b={33:0}, b={33:0}, i=15, size=14] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=15, i=13, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=15, i=13, mask={33:0}] [L26] i++ VAL [b={34:0}, i=14, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=14, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=15, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=0, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=140, i=0, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=1, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=138, i=1, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=2, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=142, i=2, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=3, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=144, i=3, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=4, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=143, i=4, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=5, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=153, i=5, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=6, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=149, i=6, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=7, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=133, i=7, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=8, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=151, i=8, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=9, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=162, i=9, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=10, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=130, i=10, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=11, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=146, i=11, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=12, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=159, i=12, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=13, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=131, i=13, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=14, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=148, i=14, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L17] COND TRUE i <= size VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR a[i] VAL [\old(size)=15, b={33:0}, b={33:0}, i=15, size=15] [L18] EXPR b[i] VAL [\old(size)=15, b={33:0}, b={33:0}, b[i]=145, i=15, size=15] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L17] COND FALSE !(i <= size) VAL [\old(size)=15, b={33:0}, b={33:0}, i=16, size=15] [L20] return i; VAL [\old(size)=15, \result=16, b={33:0}, b={33:0}, i=16, size=15] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=16, i=14, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=16, i=14, mask={33:0}] [L26] i++ VAL [b={34:0}, i=15, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=15, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=16, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=0, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=140, i=0, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=1, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=138, i=1, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=2, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=142, i=2, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=3, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=144, i=3, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=4, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=143, i=4, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=5, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=153, i=5, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=6, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=149, i=6, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=7, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=133, i=7, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=8, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=151, i=8, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=9, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=162, i=9, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=10, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=130, i=10, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=11, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=146, i=11, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=12, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=159, i=12, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=13, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=131, i=13, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=14, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=148, i=14, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=15, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=145, i=15, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L17] COND TRUE i <= size VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR a[i] VAL [\old(size)=16, b={33:0}, b={33:0}, i=16, size=16] [L18] EXPR b[i] VAL [\old(size)=16, b={33:0}, b={33:0}, b[i]=134, i=16, size=16] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L17] COND FALSE !(i <= size) VAL [\old(size)=16, b={33:0}, b={33:0}, i=17, size=16] [L20] return i; VAL [\old(size)=16, \result=17, b={33:0}, b={33:0}, i=17, size=16] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=17, i=15, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=17, i=15, mask={33:0}] [L26] i++ VAL [b={34:0}, i=16, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=16, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=17, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=0, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=140, i=0, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=1, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=138, i=1, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=2, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=142, i=2, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=3, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=144, i=3, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=4, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=143, i=4, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=5, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=153, i=5, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=6, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=149, i=6, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=7, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=133, i=7, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=8, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=151, i=8, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=9, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=162, i=9, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=10, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=130, i=10, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=11, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=146, i=11, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=12, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=159, i=12, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=13, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=131, i=13, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=14, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=148, i=14, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=15, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=145, i=15, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=16, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=134, i=16, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L17] COND TRUE i <= size VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR a[i] VAL [\old(size)=17, b={33:0}, b={33:0}, i=17, size=17] [L18] EXPR b[i] VAL [\old(size)=17, b={33:0}, b={33:0}, b[i]=139, i=17, size=17] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L17] COND FALSE !(i <= size) VAL [\old(size)=17, b={33:0}, b={33:0}, i=18, size=17] [L20] return i; VAL [\old(size)=17, \result=18, b={33:0}, b={33:0}, i=18, size=17] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=18, i=16, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=18, i=16, mask={33:0}] [L26] i++ VAL [b={34:0}, i=17, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=17, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=18, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=0, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=140, i=0, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=1, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=138, i=1, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=2, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=142, i=2, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=3, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=144, i=3, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=4, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=143, i=4, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=5, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=153, i=5, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=6, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=149, i=6, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=7, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=133, i=7, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=8, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=151, i=8, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=9, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=162, i=9, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=10, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=130, i=10, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=11, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=146, i=11, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=12, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=159, i=12, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=13, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=131, i=13, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=14, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=148, i=14, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=15, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=145, i=15, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=16, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=134, i=16, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=17, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=139, i=17, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L17] COND TRUE i <= size VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR a[i] VAL [\old(size)=18, b={33:0}, b={33:0}, i=18, size=18] [L18] EXPR b[i] VAL [\old(size)=18, b={33:0}, b={33:0}, b[i]=152, i=18, size=18] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L17] COND FALSE !(i <= size) VAL [\old(size)=18, b={33:0}, b={33:0}, i=19, size=18] [L20] return i; VAL [\old(size)=18, \result=19, b={33:0}, b={33:0}, i=19, size=18] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=19, i=17, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=19, i=17, mask={33:0}] [L26] i++ VAL [b={34:0}, i=18, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=18, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=19, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=0, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=140, i=0, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=1, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=138, i=1, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=2, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=142, i=2, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=3, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=144, i=3, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=4, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=143, i=4, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=5, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=153, i=5, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=6, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=149, i=6, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=7, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=133, i=7, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=8, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=151, i=8, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=9, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=162, i=9, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=10, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=130, i=10, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=11, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=146, i=11, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=12, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=159, i=12, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=13, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=131, i=13, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=14, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=148, i=14, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=15, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=145, i=15, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=16, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=134, i=16, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=17, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=139, i=17, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=18, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=152, i=18, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L17] COND TRUE i <= size VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR a[i] VAL [\old(size)=19, b={33:0}, b={33:0}, i=19, size=19] [L18] EXPR b[i] VAL [\old(size)=19, b={33:0}, b={33:0}, b[i]=129, i=19, size=19] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L17] COND FALSE !(i <= size) VAL [\old(size)=19, b={33:0}, b={33:0}, i=20, size=19] [L20] return i; VAL [\old(size)=19, \result=20, b={33:0}, b={33:0}, i=20, size=19] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=20, i=18, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=20, i=18, mask={33:0}] [L26] i++ VAL [b={34:0}, i=19, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=19, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=20, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=0, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=140, i=0, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=1, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=138, i=1, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=2, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=142, i=2, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=3, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=144, i=3, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=4, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=143, i=4, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=5, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=153, i=5, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=6, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=149, i=6, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=7, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=133, i=7, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=8, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=151, i=8, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=9, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=162, i=9, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=10, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=130, i=10, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=11, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=146, i=11, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=12, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=159, i=12, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=13, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=131, i=13, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=14, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=148, i=14, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=15, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=145, i=15, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=16, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=134, i=16, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=17, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=139, i=17, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=18, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=152, i=18, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=19, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=129, i=19, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L17] COND TRUE i <= size VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR a[i] VAL [\old(size)=20, b={33:0}, b={33:0}, i=20, size=20] [L18] EXPR b[i] VAL [\old(size)=20, b={33:0}, b={33:0}, b[i]=157, i=20, size=20] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L17] COND FALSE !(i <= size) VAL [\old(size)=20, b={33:0}, b={33:0}, i=21, size=20] [L20] return i; VAL [\old(size)=20, \result=21, b={33:0}, b={33:0}, i=21, size=20] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=21, i=19, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=21, i=19, mask={33:0}] [L26] i++ VAL [b={34:0}, i=20, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=20, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=21, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=0, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=140, i=0, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=1, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=138, i=1, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=2, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=142, i=2, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=3, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=144, i=3, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=4, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=143, i=4, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=5, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=153, i=5, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=6, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=149, i=6, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=7, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=133, i=7, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=8, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=151, i=8, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=9, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=162, i=9, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=10, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=130, i=10, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=11, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=146, i=11, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=12, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=159, i=12, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=13, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=131, i=13, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=14, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=148, i=14, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=15, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=145, i=15, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=16, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=134, i=16, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=17, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=139, i=17, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=18, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=152, i=18, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=19, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=129, i=19, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=20, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=157, i=20, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L17] COND TRUE i <= size VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR a[i] VAL [\old(size)=21, b={33:0}, b={33:0}, i=21, size=21] [L18] EXPR b[i] VAL [\old(size)=21, b={33:0}, b={33:0}, b[i]=154, i=21, size=21] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L17] COND FALSE !(i <= size) VAL [\old(size)=21, b={33:0}, b={33:0}, i=22, size=21] [L20] return i; VAL [\old(size)=21, \result=22, b={33:0}, b={33:0}, i=22, size=21] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=22, i=20, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=22, i=20, mask={33:0}] [L26] i++ VAL [b={34:0}, i=21, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=21, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=22, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=0, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=140, i=0, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=1, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=138, i=1, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=2, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=142, i=2, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=3, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=144, i=3, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=4, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=143, i=4, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=5, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=153, i=5, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=6, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=149, i=6, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=7, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=133, i=7, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=8, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=151, i=8, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=9, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=162, i=9, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=10, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=130, i=10, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=11, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=146, i=11, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=12, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=159, i=12, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=13, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=131, i=13, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=14, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=148, i=14, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=15, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=145, i=15, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=16, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=134, i=16, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=17, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=139, i=17, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=18, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=152, i=18, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=19, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=129, i=19, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=20, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=157, i=20, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=21, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=154, i=21, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L17] COND TRUE i <= size VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR a[i] VAL [\old(size)=22, b={33:0}, b={33:0}, i=22, size=22] [L18] EXPR b[i] VAL [\old(size)=22, b={33:0}, b={33:0}, b[i]=155, i=22, size=22] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L17] COND FALSE !(i <= size) VAL [\old(size)=22, b={33:0}, b={33:0}, i=23, size=22] [L20] return i; VAL [\old(size)=22, \result=23, b={33:0}, b={33:0}, i=23, size=22] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=23, i=21, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=23, i=21, mask={33:0}] [L26] i++ VAL [b={34:0}, i=22, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=22, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=23, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=0, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=140, i=0, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=1, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=138, i=1, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=2, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=142, i=2, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=3, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=144, i=3, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=4, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=143, i=4, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=5, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=153, i=5, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=6, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=149, i=6, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=7, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=133, i=7, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=8, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=151, i=8, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=9, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=162, i=9, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=10, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=130, i=10, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=11, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=146, i=11, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=12, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=159, i=12, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=13, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=131, i=13, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=14, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=148, i=14, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=15, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=145, i=15, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=16, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=134, i=16, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=17, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=139, i=17, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=18, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=152, i=18, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=19, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=129, i=19, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=20, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=157, i=20, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=21, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=154, i=21, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=22, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=155, i=22, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L17] COND TRUE i <= size VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR a[i] VAL [\old(size)=23, b={33:0}, b={33:0}, i=23, size=23] [L18] EXPR b[i] VAL [\old(size)=23, b={33:0}, b={33:0}, b[i]=150, i=23, size=23] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L17] COND FALSE !(i <= size) VAL [\old(size)=23, b={33:0}, b={33:0}, i=24, size=23] [L20] return i; VAL [\old(size)=23, \result=24, b={33:0}, b={33:0}, i=24, size=23] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=24, i=22, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=24, i=22, mask={33:0}] [L26] i++ VAL [b={34:0}, i=23, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=23, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=24, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=0, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=140, i=0, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=1, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=138, i=1, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=2, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=142, i=2, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=3, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=144, i=3, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=4, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=143, i=4, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=5, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=153, i=5, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=6, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=149, i=6, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=7, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=133, i=7, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=8, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=151, i=8, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=9, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=162, i=9, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=10, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=130, i=10, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=11, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=146, i=11, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=12, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=159, i=12, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=13, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=131, i=13, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=14, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=148, i=14, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=15, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=145, i=15, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=16, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=134, i=16, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=17, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=139, i=17, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=18, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=152, i=18, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=19, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=129, i=19, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=20, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=157, i=20, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=21, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=154, i=21, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=22, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=155, i=22, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=23, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=150, i=23, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L17] COND TRUE i <= size VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR a[i] VAL [\old(size)=24, b={33:0}, b={33:0}, i=24, size=24] [L18] EXPR b[i] VAL [\old(size)=24, b={33:0}, b={33:0}, b[i]=147, i=24, size=24] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L17] COND FALSE !(i <= size) VAL [\old(size)=24, b={33:0}, b={33:0}, i=25, size=24] [L20] return i; VAL [\old(size)=24, \result=25, b={33:0}, b={33:0}, i=25, size=24] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=25, i=23, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=25, i=23, mask={33:0}] [L26] i++ VAL [b={34:0}, i=24, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=24, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=25, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=0, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=140, i=0, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=1, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=138, i=1, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=2, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=142, i=2, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=3, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=144, i=3, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=4, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=143, i=4, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=5, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=153, i=5, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=6, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=149, i=6, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=7, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=133, i=7, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=8, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=151, i=8, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=9, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=162, i=9, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=10, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=130, i=10, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=11, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=146, i=11, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=12, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=159, i=12, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=13, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=131, i=13, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=14, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=148, i=14, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=15, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=145, i=15, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=16, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=134, i=16, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=17, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=139, i=17, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=18, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=152, i=18, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=19, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=129, i=19, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=20, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=157, i=20, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=21, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=154, i=21, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=22, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=155, i=22, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=23, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=150, i=23, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=24, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=147, i=24, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L17] COND TRUE i <= size VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR a[i] VAL [\old(size)=25, b={33:0}, b={33:0}, i=25, size=25] [L18] EXPR b[i] VAL [\old(size)=25, b={33:0}, b={33:0}, b[i]=158, i=25, size=25] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L17] COND FALSE !(i <= size) VAL [\old(size)=25, b={33:0}, b={33:0}, i=26, size=25] [L20] return i; VAL [\old(size)=25, \result=26, b={33:0}, b={33:0}, i=26, size=25] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=26, i=24, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=26, i=24, mask={33:0}] [L26] i++ VAL [b={34:0}, i=25, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=25, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=26, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=0, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=140, i=0, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=1, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=138, i=1, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=2, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=142, i=2, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=3, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=144, i=3, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=4, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=143, i=4, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=5, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=153, i=5, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=6, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=149, i=6, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=7, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=133, i=7, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=8, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=151, i=8, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=9, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=162, i=9, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=10, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=130, i=10, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=11, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=146, i=11, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=12, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=159, i=12, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=13, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=131, i=13, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=14, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=148, i=14, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=15, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=145, i=15, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=16, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=134, i=16, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=17, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=139, i=17, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=18, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=152, i=18, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=19, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=129, i=19, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=20, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=157, i=20, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=21, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=154, i=21, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=22, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=155, i=22, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=23, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=150, i=23, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=24, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=147, i=24, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=25, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=158, i=25, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L17] COND TRUE i <= size VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR a[i] VAL [\old(size)=26, b={33:0}, b={33:0}, i=26, size=26] [L18] EXPR b[i] VAL [\old(size)=26, b={33:0}, b={33:0}, b[i]=132, i=26, size=26] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L17] COND FALSE !(i <= size) VAL [\old(size)=26, b={33:0}, b={33:0}, i=27, size=26] [L20] return i; VAL [\old(size)=26, \result=27, b={33:0}, b={33:0}, i=27, size=26] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=27, i=25, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=27, i=25, mask={33:0}] [L26] i++ VAL [b={34:0}, i=26, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=26, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=27, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=0, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=140, i=0, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=1, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=138, i=1, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=2, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=142, i=2, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=3, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=144, i=3, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=4, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=143, i=4, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=5, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=153, i=5, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=6, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=149, i=6, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=7, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=133, i=7, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=8, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=151, i=8, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=9, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=162, i=9, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=10, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=130, i=10, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=11, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=146, i=11, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=12, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=159, i=12, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=13, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=131, i=13, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=14, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=148, i=14, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=15, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=145, i=15, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=16, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=134, i=16, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=17, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=139, i=17, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=18, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=152, i=18, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=19, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=129, i=19, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=20, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=157, i=20, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=21, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=154, i=21, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=22, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=155, i=22, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=23, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=150, i=23, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=24, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=147, i=24, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=25, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=158, i=25, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=26, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=132, i=26, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L17] COND TRUE i <= size VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR a[i] VAL [\old(size)=27, b={33:0}, b={33:0}, i=27, size=27] [L18] EXPR b[i] VAL [\old(size)=27, b={33:0}, b={33:0}, b[i]=156, i=27, size=27] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L17] COND FALSE !(i <= size) VAL [\old(size)=27, b={33:0}, b={33:0}, i=28, size=27] [L20] return i; VAL [\old(size)=27, \result=28, b={33:0}, b={33:0}, i=28, size=27] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=28, i=26, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=28, i=26, mask={33:0}] [L26] i++ VAL [b={34:0}, i=27, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=27, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=28, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=0, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=140, i=0, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=1, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=138, i=1, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=2, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=142, i=2, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=3, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=144, i=3, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=4, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=143, i=4, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=5, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=153, i=5, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=6, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=149, i=6, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=7, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=133, i=7, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=8, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=151, i=8, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=9, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=162, i=9, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=10, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=130, i=10, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=11, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=146, i=11, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=12, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=159, i=12, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=13, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=131, i=13, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=14, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=148, i=14, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=15, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=145, i=15, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=16, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=134, i=16, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=17, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=139, i=17, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=18, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=152, i=18, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=19, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=129, i=19, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=20, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=157, i=20, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=21, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=154, i=21, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=22, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=155, i=22, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=23, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=150, i=23, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=24, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=147, i=24, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=25, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=158, i=25, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=26, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=132, i=26, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=27, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=156, i=27, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L17] COND TRUE i <= size VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR a[i] VAL [\old(size)=28, b={33:0}, b={33:0}, i=28, size=28] [L18] EXPR b[i] VAL [\old(size)=28, b={33:0}, b={33:0}, b[i]=136, i=28, size=28] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L17] COND FALSE !(i <= size) VAL [\old(size)=28, b={33:0}, b={33:0}, i=29, size=28] [L20] return i; VAL [\old(size)=28, \result=29, b={33:0}, b={33:0}, i=29, size=28] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=29, i=27, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=29, i=27, mask={33:0}] [L26] i++ VAL [b={34:0}, i=28, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=28, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=29, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=0, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=140, i=0, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=1, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=138, i=1, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=2, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=142, i=2, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=3, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=144, i=3, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=4, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=143, i=4, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=5, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=153, i=5, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=6, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=149, i=6, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=7, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=133, i=7, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=8, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=151, i=8, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=9, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=162, i=9, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=10, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=130, i=10, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=11, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=146, i=11, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=12, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=159, i=12, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=13, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=131, i=13, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=14, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=148, i=14, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=15, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=145, i=15, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=16, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=134, i=16, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=17, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=139, i=17, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=18, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=152, i=18, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=19, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=129, i=19, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=20, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=157, i=20, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=21, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=154, i=21, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=22, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=155, i=22, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=23, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=150, i=23, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=24, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=147, i=24, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=25, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=158, i=25, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=26, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=132, i=26, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=27, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=156, i=27, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=28, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=136, i=28, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L17] COND TRUE i <= size VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR a[i] VAL [\old(size)=29, b={33:0}, b={33:0}, i=29, size=29] [L18] EXPR b[i] VAL [\old(size)=29, b={33:0}, b={33:0}, b[i]=161, i=29, size=29] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L17] COND FALSE !(i <= size) VAL [\old(size)=29, b={33:0}, b={33:0}, i=30, size=29] [L20] return i; VAL [\old(size)=29, \result=30, b={33:0}, b={33:0}, i=30, size=29] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=30, i=28, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=30, i=28, mask={33:0}] [L26] i++ VAL [b={34:0}, i=29, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=29, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=30, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=0, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=140, i=0, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=1, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=138, i=1, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=2, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=142, i=2, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=3, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=144, i=3, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=4, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=143, i=4, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=5, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=153, i=5, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=6, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=149, i=6, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=7, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=133, i=7, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=8, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=151, i=8, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=9, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=162, i=9, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=10, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=130, i=10, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=11, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=146, i=11, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=12, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=159, i=12, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=13, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=131, i=13, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=14, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=148, i=14, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=15, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=145, i=15, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=16, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=134, i=16, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=17, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=139, i=17, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=18, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=152, i=18, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=19, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=129, i=19, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=20, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=157, i=20, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=21, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=154, i=21, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=22, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=155, i=22, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=23, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=150, i=23, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=24, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=147, i=24, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=25, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=158, i=25, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=26, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=132, i=26, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=27, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=156, i=27, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=28, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=136, i=28, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=29, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=161, i=29, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L17] COND TRUE i <= size VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR a[i] VAL [\old(size)=30, b={33:0}, b={33:0}, i=30, size=30] [L18] EXPR b[i] VAL [\old(size)=30, b={33:0}, b={33:0}, b[i]=141, i=30, size=30] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L17] COND FALSE !(i <= size) VAL [\old(size)=30, b={33:0}, b={33:0}, i=31, size=30] [L20] return i; VAL [\old(size)=30, \result=31, b={33:0}, b={33:0}, i=31, size=30] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=31, i=29, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=31, i=29, mask={33:0}] [L26] i++ VAL [b={34:0}, i=30, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=30, mask={33:0}] [L27] CALL, EXPR foo(mask, i + 1) VAL [\old(size)=31, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=0, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=140, i=0, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=1, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=138, i=1, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=2, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=142, i=2, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=3, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=144, i=3, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=4, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=143, i=4, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=5, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=153, i=5, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=6, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=149, i=6, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=7, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=133, i=7, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=8, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=151, i=8, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=9, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=162, i=9, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=10, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=130, i=10, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=11, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=146, i=11, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=12, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=159, i=12, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=13, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=131, i=13, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=14, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=148, i=14, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=15, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=145, i=15, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=16, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=134, i=16, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=17, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=139, i=17, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=18, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=152, i=18, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=19, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=129, i=19, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=20, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=157, i=20, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=21, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=154, i=21, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=22, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=155, i=22, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=23, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=150, i=23, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=24, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=147, i=24, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=25, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=158, i=25, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=26, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=132, i=26, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=27, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=156, i=27, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=28, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=136, i=28, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=29, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=161, i=29, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=30, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=141, i=30, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L17] COND TRUE i <= size VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR a[i] VAL [\old(size)=31, b={33:0}, b={33:0}, i=31, size=31] [L18] EXPR b[i] VAL [\old(size)=31, b={33:0}, b={33:0}, b[i]=135, i=31, size=31] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L17] COND FALSE !(i <= size) VAL [\old(size)=31, b={33:0}, b={33:0}, i=32, size=31] [L20] return i; VAL [\old(size)=31, \result=32, b={33:0}, b={33:0}, i=32, size=31] [L27] RET, EXPR foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=32, i=30, mask={33:0}] [L27] b[i] = foo(mask, i + 1) VAL [b={34:0}, foo(mask, i + 1)=32, i=30, mask={33:0}] [L26] i++ VAL [b={34:0}, i=31, mask={33:0}] [L26] COND TRUE i < sizeof(mask) VAL [b={34:0}, i=31, mask={33:0}] [L27] CALL foo(mask, i + 1) VAL [\old(size)=32, b={33:0}] [L15] char a[32]; [L16] int i; [L17] i = 0 VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=0, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=140, i=0, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=1, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=138, i=1, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=2, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=142, i=2, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=3, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=144, i=3, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=4, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=143, i=4, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=5, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=153, i=5, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=6, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=149, i=6, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=7, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=133, i=7, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=8, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=151, i=8, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=9, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=162, i=9, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=10, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=130, i=10, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=11, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=146, i=11, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=12, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=159, i=12, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=13, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=131, i=13, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=14, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=148, i=14, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=15, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=145, i=15, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=16, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=134, i=16, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=17, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=139, i=17, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=18, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=152, i=18, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=19, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=129, i=19, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=20, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=157, i=20, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=21, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=154, i=21, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=22, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=155, i=22, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=23, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=150, i=23, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=24, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=147, i=24, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=25, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=158, i=25, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=26, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=132, i=26, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=27, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=156, i=27, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=28, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=136, i=28, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=29, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=161, i=29, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=30, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=141, i=30, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=31, size=32] [L18] EXPR b[i] VAL [\old(size)=32, b={33:0}, b={33:0}, b[i]=135, i=31, size=32] [L18] a[i] = b[i] [L17] i++ VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L17] COND TRUE i <= size VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] [L18] a[i] VAL [\old(size)=32, b={33:0}, b={33:0}, i=32, size=32] - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 403212.66ms, OverallIterations: 49, TraceHistogramMax: 560, EmptinessCheckTime: 877.06ms, AutomataDifference: 88484.19ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 10.10ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36450 SdHoareTripleChecker+Valid, 25025.71ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36392 mSDsluCounter, 4360 SdHoareTripleChecker+Invalid, 20800.02ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 167 IncrementalHoareTripleChecker+Unchecked, 15148 mSDsCounter, 7484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66442 IncrementalHoareTripleChecker+Invalid, 74093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7484 mSolverCounterUnsat, 592 mSDtfsCounter, 66442 mSolverCounterSat, 244.48ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96814 GetRequests, 92511 SyntacticMatches, 85 SemanticMatches, 4218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232226 ImplicationChecksByTransitivity, 100993.64ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6614occurred in iteration=48, InterpolantAutomatonStates: 2473, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 821.54ms AutomataMinimizationTime, 48 MinimizatonAttempts, 4464 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2758.95ms SsaConstructionTime, 129127.75ms SatisfiabilityAnalysisTime, 168369.75ms InterpolantComputationTime, 96409 NumberOfCodeBlocks, 86335 NumberOfCodeBlocksAsserted, 516 NumberOfCheckSat, 139066 ConstructedInterpolants, 512 QuantifiedInterpolants, 212096 SizeOfPredicates, 109 NumberOfNonLiveVariables, 92572 ConjunctsInSsa, 1008 ConjunctsInUnsatCore, 124 InterpolantComputations, 13 PerfectInterpolantSequences, 24389558/25087381 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! [2021-08-30 17:49:08,711 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...