./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ArraysOfVariableLength5.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 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:37:36,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:36,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:36,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:36,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:36,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:36,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:36,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:36,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:36,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:36,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:36,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:36,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:36,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:36,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:36,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:36,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:36,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:36,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:36,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:36,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:36,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:36,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:36,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:36,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:36,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:36,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:36,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:36,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:36,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:36,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:36,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:36,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:36,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:36,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:36,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:36,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:36,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:36,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:36,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:36,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:36,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:36,561 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:36,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:36,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:36,564 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:36,564 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:36,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:36,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:36,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:36,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:36,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:36,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:36,567 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:36,567 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:36,568 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:36,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:36,569 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:36,569 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:36,569 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:36,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:36,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:36,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:36,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:36,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:36,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:36,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:36,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:36,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:36,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2019-11-28 02:37:36,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:36,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:36,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:36,924 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:36,925 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:36,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2019-11-28 02:37:37,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ce8e305/f408915775084c8e94fbfaa905c13bb3/FLAG35ecb71c6 [2019-11-28 02:37:37,474 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:37,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength5.c [2019-11-28 02:37:37,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ce8e305/f408915775084c8e94fbfaa905c13bb3/FLAG35ecb71c6 [2019-11-28 02:37:37,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80ce8e305/f408915775084c8e94fbfaa905c13bb3 [2019-11-28 02:37:37,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:37,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:37,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:37,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:37,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:37,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c12937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37, skipping insertion in model container [2019-11-28 02:37:37,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:37,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:38,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:38,082 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:38,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:38,116 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:38,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38 WrapperNode [2019-11-28 02:37:38,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:38,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:38,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:38,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:38,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... [2019-11-28 02:37:38,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:38,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:38,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:38,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:38,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:38,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:38,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:38,298 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:37:38,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:37:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:38,640 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:38,640 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:37:38,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38 BoogieIcfgContainer [2019-11-28 02:37:38,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:38,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:38,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:38,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:38,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:37" (1/3) ... [2019-11-28 02:37:38,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6204c5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:38, skipping insertion in model container [2019-11-28 02:37:38,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:38" (2/3) ... [2019-11-28 02:37:38,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6204c5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:38, skipping insertion in model container [2019-11-28 02:37:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38" (3/3) ... [2019-11-28 02:37:38,656 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5.c [2019-11-28 02:37:38,666 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:38,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:37:38,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:37:38,700 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:38,700 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:38,700 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:38,700 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:38,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:38,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:38,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:38,701 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 02:37:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:38,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:38,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:38,725 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:38,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 02:37:38,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:38,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86435898] [2019-11-28 02:37:38,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:38,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86435898] [2019-11-28 02:37:38,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:38,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:38,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565527477] [2019-11-28 02:37:38,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:38,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:38,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:38,944 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 02:37:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,154 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 02:37:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:39,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,167 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:37:39,167 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:39,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 02:37:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:39,222 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 02:37:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,223 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:39,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:39,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,225 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 02:37:39,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909259320] [2019-11-28 02:37:39,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909259320] [2019-11-28 02:37:39,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:39,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104350690] [2019-11-28 02:37:39,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:39,348 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2019-11-28 02:37:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,584 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-11-28 02:37:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:39,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 02:37:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,587 INFO L225 Difference]: With dead ends: 59 [2019-11-28 02:37:39,587 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 02:37:39,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 02:37:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-11-28 02:37:39,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:39,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-11-28 02:37:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,602 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:39,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:39,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,604 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 02:37:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553127337] [2019-11-28 02:37:39,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553127337] [2019-11-28 02:37:39,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:39,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983497520] [2019-11-28 02:37:39,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:39,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:39,745 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2019-11-28 02:37:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,826 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-28 02:37:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:39,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:37:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,829 INFO L225 Difference]: With dead ends: 43 [2019-11-28 02:37:39,829 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 02:37:39,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 02:37:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 02:37:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:37:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-28 02:37:39,837 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-11-28 02:37:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,837 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-28 02:37:39,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-28 02:37:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:39,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,839 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-11-28 02:37:39,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608172608] [2019-11-28 02:37:39,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608172608] [2019-11-28 02:37:39,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:39,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494575431] [2019-11-28 02:37:39,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:39,919 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2019-11-28 02:37:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,033 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 02:37:40,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:40,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 02:37:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,035 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:37:40,036 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:37:40,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:37:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-11-28 02:37:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:40,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-11-28 02:37:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,051 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:40,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:37:40,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,054 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-11-28 02:37:40,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276670942] [2019-11-28 02:37:40,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276670942] [2019-11-28 02:37:40,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264308278] [2019-11-28 02:37:40,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:37:40,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:40,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-28 02:37:40,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288274862] [2019-11-28 02:37:40,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:40,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:40,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:40,288 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2019-11-28 02:37:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,425 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-28 02:37:40,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:40,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 02:37:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,428 INFO L225 Difference]: With dead ends: 69 [2019-11-28 02:37:40,428 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 02:37:40,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 02:37:40,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-11-28 02:37:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 02:37:40,437 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-11-28 02:37:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,437 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 02:37:40,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 02:37:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:37:40,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,439 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,643 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-11-28 02:37:40,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148819525] [2019-11-28 02:37:40,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148819525] [2019-11-28 02:37:40,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842623255] [2019-11-28 02:37:40,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 02:37:40,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 02:37:40,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:40,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-11-28 02:37:40,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272205829] [2019-11-28 02:37:40,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:37:40,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:37:40,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:40,816 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 3 states. [2019-11-28 02:37:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,847 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-28 02:37:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:37:40,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:37:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,849 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:40,849 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 02:37:40,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 02:37:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-11-28 02:37:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:37:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-11-28 02:37:40,856 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-11-28 02:37:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,857 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-11-28 02:37:40,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:37:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-11-28 02:37:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:37:40,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,858 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:41,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-11-28 02:37:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:41,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646877898] [2019-11-28 02:37:41,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:41,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646877898] [2019-11-28 02:37:41,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172664210] [2019-11-28 02:37:41,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:41,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:41,256 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-28 02:37:41,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 02:37:41,258 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:41,268 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:41,269 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:41,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-28 02:37:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:41,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:41,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 02:37:41,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650680356] [2019-11-28 02:37:41,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:37:41,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:41,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:37:41,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:41,325 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 8 states. [2019-11-28 02:37:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:41,488 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-28 02:37:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:41,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 02:37:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:41,490 INFO L225 Difference]: With dead ends: 53 [2019-11-28 02:37:41,490 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:37:41,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:37:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 02:37:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 02:37:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-11-28 02:37:41,497 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-11-28 02:37:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:41,497 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-11-28 02:37:41,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:37:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-11-28 02:37:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:37:41,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:41,499 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:41,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,700 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:41,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-11-28 02:37:41,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:41,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061851054] [2019-11-28 02:37:41,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:41,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061851054] [2019-11-28 02:37:41,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979914580] [2019-11-28 02:37:41,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 02:37:41,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:41,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:41,903 INFO L377 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 9 treesize of output 25 [2019-11-28 02:37:41,904 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:41,928 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-28 02:37:41,929 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:37:41,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-28 02:37:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:42,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-28 02:37:42,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704385006] [2019-11-28 02:37:42,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:37:42,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:37:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:42,005 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2019-11-28 02:37:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:42,229 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-28 02:37:42,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:37:42,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 02:37:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:42,230 INFO L225 Difference]: With dead ends: 55 [2019-11-28 02:37:42,231 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 02:37:42,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:37:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 02:37:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-11-28 02:37:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-11-28 02:37:42,242 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-11-28 02:37:42,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:42,243 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-11-28 02:37:42,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:37:42,243 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-11-28 02:37:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 02:37:42,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:42,264 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:42,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,469 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-11-28 02:37:42,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:42,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115202807] [2019-11-28 02:37:42,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:42,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115202807] [2019-11-28 02:37:42,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332503907] [2019-11-28 02:37:42,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:37:42,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 02:37:42,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:42,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-11-28 02:37:42,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539100514] [2019-11-28 02:37:42,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:42,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:42,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:42,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:37:42,637 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-11-28 02:37:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:42,764 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-28 02:37:42,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:42,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 02:37:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:42,767 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:42,767 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 02:37:42,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:42,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 02:37:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-11-28 02:37:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:37:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-11-28 02:37:42,782 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2019-11-28 02:37:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:42,783 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-11-28 02:37:42,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-11-28 02:37:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 02:37:42,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:42,785 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:42,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,986 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-11-28 02:37:42,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:42,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831586389] [2019-11-28 02:37:42,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:43,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831586389] [2019-11-28 02:37:43,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622201163] [2019-11-28 02:37:43,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:37:43,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:43,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:43,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-11-28 02:37:43,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115820716] [2019-11-28 02:37:43,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:37:43,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:37:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:43,208 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2019-11-28 02:37:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:43,458 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-11-28 02:37:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:37:43,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 02:37:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:43,459 INFO L225 Difference]: With dead ends: 79 [2019-11-28 02:37:43,459 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 02:37:43,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:37:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 02:37:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-11-28 02:37:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:37:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 02:37:43,465 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2019-11-28 02:37:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:43,466 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 02:37:43,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:37:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 02:37:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 02:37:43,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:43,467 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:43,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,672 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:43,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2019-11-28 02:37:43,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:43,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223619105] [2019-11-28 02:37:43,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:37:43,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223619105] [2019-11-28 02:37:43,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464047] [2019-11-28 02:37:43,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:37:43,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:43,836 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_13|], 1=[|v_#valid_25|]} [2019-11-28 02:37:43,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:43,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 02:37:43,849 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:43,858 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:43,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:43,867 INFO L377 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 5 treesize of output 3 [2019-11-28 02:37:43,867 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:43,876 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:43,877 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:43,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 02:37:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:37:44,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:44,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-28 02:37:44,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847307899] [2019-11-28 02:37:44,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:37:44,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:37:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:37:44,010 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 9 states. [2019-11-28 02:37:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:44,269 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-11-28 02:37:44,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:44,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 02:37:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:44,270 INFO L225 Difference]: With dead ends: 67 [2019-11-28 02:37:44,270 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 02:37:44,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 02:37:44,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-11-28 02:37:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 02:37:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-11-28 02:37:44,286 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 31 [2019-11-28 02:37:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:44,286 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-11-28 02:37:44,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:37:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-11-28 02:37:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 02:37:44,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:44,288 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:44,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:44,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:44,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:44,493 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2019-11-28 02:37:44,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:44,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338636417] [2019-11-28 02:37:44,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:37:44,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338636417] [2019-11-28 02:37:44,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973612188] [2019-11-28 02:37:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:44,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:37:44,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:37:44,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:44,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:37:44,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842835343] [2019-11-28 02:37:44,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:44,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:44,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:44,626 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 7 states. [2019-11-28 02:37:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:44,800 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-11-28 02:37:44,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:44,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-28 02:37:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:44,802 INFO L225 Difference]: With dead ends: 93 [2019-11-28 02:37:44,802 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 02:37:44,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 02:37:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2019-11-28 02:37:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 02:37:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-11-28 02:37:44,807 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 37 [2019-11-28 02:37:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:44,808 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-11-28 02:37:44,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-11-28 02:37:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 02:37:44,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:44,809 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:45,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:45,016 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-11-28 02:37:45,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:45,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128077033] [2019-11-28 02:37:45,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:37:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128077033] [2019-11-28 02:37:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823739601] [2019-11-28 02:37:45,108 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:45,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:37:45,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:45,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:37:45,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 02:37:45,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:45,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-28 02:37:45,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6113821] [2019-11-28 02:37:45,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 02:37:45,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 02:37:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:37:45,283 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 16 states. [2019-11-28 02:37:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:45,772 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-11-28 02:37:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 02:37:45,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2019-11-28 02:37:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:45,774 INFO L225 Difference]: With dead ends: 117 [2019-11-28 02:37:45,774 INFO L226 Difference]: Without dead ends: 117 [2019-11-28 02:37:45,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-11-28 02:37:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-28 02:37:45,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-11-28 02:37:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-28 02:37:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-11-28 02:37:45,781 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 43 [2019-11-28 02:37:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:45,782 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-11-28 02:37:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 02:37:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-11-28 02:37:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 02:37:45,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:45,784 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:45,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:45,989 INFO L410 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:45,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2019-11-28 02:37:45,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:45,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516114114] [2019-11-28 02:37:45,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 02:37:46,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516114114] [2019-11-28 02:37:46,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405455063] [2019-11-28 02:37:46,135 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:46,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:37:46,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:46,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:46,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:37:46,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:46,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-28 02:37:46,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788401885] [2019-11-28 02:37:46,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:37:46,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:37:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:37:46,297 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 14 states. [2019-11-28 02:37:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:46,760 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-11-28 02:37:46,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:37:46,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2019-11-28 02:37:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:46,762 INFO L225 Difference]: With dead ends: 122 [2019-11-28 02:37:46,763 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 02:37:46,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-11-28 02:37:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 02:37:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-11-28 02:37:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 02:37:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-11-28 02:37:46,768 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 47 [2019-11-28 02:37:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:46,769 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-11-28 02:37:46,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:37:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-11-28 02:37:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 02:37:46,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:46,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:46,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:46,977 INFO L410 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2019-11-28 02:37:46,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203100764] [2019-11-28 02:37:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 02:37:47,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203100764] [2019-11-28 02:37:47,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962674562] [2019-11-28 02:37:47,213 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:47,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 02:37:47,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:47,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:37:47,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:47,297 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_26|]} [2019-11-28 02:37:47,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:47,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 02:37:47,303 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:47,314 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:47,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:47,319 INFO L377 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 5 treesize of output 3 [2019-11-28 02:37:47,320 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:47,326 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:47,327 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:47,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 02:37:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 02:37:47,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:47,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2019-11-28 02:37:47,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912016441] [2019-11-28 02:37:47,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 02:37:47,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:47,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 02:37:47,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:37:47,626 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 18 states. [2019-11-28 02:37:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:48,870 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2019-11-28 02:37:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 02:37:48,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-11-28 02:37:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:48,873 INFO L225 Difference]: With dead ends: 126 [2019-11-28 02:37:48,874 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 02:37:48,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 02:37:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 02:37:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2019-11-28 02:37:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-28 02:37:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-11-28 02:37:48,883 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 52 [2019-11-28 02:37:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:48,883 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-11-28 02:37:48,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 02:37:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-11-28 02:37:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-28 02:37:48,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:48,887 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:49,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:49,094 INFO L410 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash -185613816, now seen corresponding path program 2 times [2019-11-28 02:37:49,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:49,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805401028] [2019-11-28 02:37:49,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-28 02:37:49,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805401028] [2019-11-28 02:37:49,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209014907] [2019-11-28 02:37:49,322 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:49,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:49,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:49,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:49,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:49,400 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_27|]} [2019-11-28 02:37:49,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:49,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-28 02:37:49,408 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:49,418 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:49,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:49,424 INFO L377 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 5 treesize of output 3 [2019-11-28 02:37:49,425 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:49,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:49,432 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:49,433 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-28 02:37:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-11-28 02:37:49,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:49,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2019-11-28 02:37:49,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620507169] [2019-11-28 02:37:49,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:49,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:49,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:49,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:37:49,842 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 6 states. [2019-11-28 02:37:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:49,888 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2019-11-28 02:37:49,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:49,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-11-28 02:37:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:49,890 INFO L225 Difference]: With dead ends: 118 [2019-11-28 02:37:49,890 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 02:37:49,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:37:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 02:37:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 02:37:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 02:37:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2019-11-28 02:37:49,895 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 126 [2019-11-28 02:37:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2019-11-28 02:37:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2019-11-28 02:37:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 02:37:49,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:49,898 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:50,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:50,102 INFO L410 AbstractCegarLoop]: === Iteration 17 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1998281440, now seen corresponding path program 1 times [2019-11-28 02:37:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484899852] [2019-11-28 02:37:50,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-28 02:37:50,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484899852] [2019-11-28 02:37:50,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365895773] [2019-11-28 02:37:50,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:50,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:37:50,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 326 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-11-28 02:37:50,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:50,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 02:37:50,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100339418] [2019-11-28 02:37:50,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 02:37:50,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:50,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 02:37:50,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:37:50,481 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 18 states. [2019-11-28 02:37:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:51,120 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2019-11-28 02:37:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 02:37:51,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 129 [2019-11-28 02:37:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:51,122 INFO L225 Difference]: With dead ends: 181 [2019-11-28 02:37:51,122 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 02:37:51,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-11-28 02:37:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 02:37:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 133. [2019-11-28 02:37:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 02:37:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2019-11-28 02:37:51,131 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 129 [2019-11-28 02:37:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:51,132 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2019-11-28 02:37:51,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 02:37:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2019-11-28 02:37:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 02:37:51,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:51,134 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:51,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:51,339 INFO L410 AbstractCegarLoop]: === Iteration 18 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1503661553, now seen corresponding path program 2 times [2019-11-28 02:37:51,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:51,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888591156] [2019-11-28 02:37:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-11-28 02:37:51,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888591156] [2019-11-28 02:37:51,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004983301] [2019-11-28 02:37:51,510 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:51,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:51,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:51,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:51,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:51,622 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:51,623 INFO L377 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 29 [2019-11-28 02:37:51,623 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,628 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,629 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:51,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:51,692 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:51,692 INFO L377 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 29 [2019-11-28 02:37:51,693 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,699 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,700 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:51,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:51,760 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:51,761 INFO L377 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 29 [2019-11-28 02:37:51,761 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,767 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,768 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:51,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:51,849 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:51,849 INFO L377 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 29 [2019-11-28 02:37:51,850 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,855 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,856 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:51,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:51,955 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:51,955 INFO L377 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 29 [2019-11-28 02:37:51,956 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:51,963 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:51,963 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:51,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,029 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:52,030 INFO L377 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 29 [2019-11-28 02:37:52,030 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:52,035 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:52,036 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:52,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,096 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:52,097 INFO L377 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 29 [2019-11-28 02:37:52,097 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:52,103 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:52,103 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 02:37:52,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2019-11-28 02:37:52,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:52,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2019-11-28 02:37:52,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955076166] [2019-11-28 02:37:52,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:52,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:52,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:37:52,276 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 6 states. [2019-11-28 02:37:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:52,378 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2019-11-28 02:37:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:52,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-11-28 02:37:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:52,379 INFO L225 Difference]: With dead ends: 132 [2019-11-28 02:37:52,379 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:52,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-28 02:37:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:52,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-11-28 02:37:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:52,381 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:52,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:52,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:52,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:52,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:52 BoogieIcfgContainer [2019-11-28 02:37:52,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:52,588 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:52,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:52,588 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:52,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:38" (3/4) ... [2019-11-28 02:37:52,591 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:52,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:52,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 02:37:52,597 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:52,606 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-28 02:37:52,606 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:37:52,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:37:52,607 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:52,653 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:52,653 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:52,655 INFO L168 Benchmark]: Toolchain (without parser) took 14816.49 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -234.0 MB). Peak memory consumption was 118.3 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:52,655 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:52,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.43 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:52,656 INFO L168 Benchmark]: Boogie Preprocessor took 125.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:52,656 INFO L168 Benchmark]: RCFGBuilder took 398.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:52,656 INFO L168 Benchmark]: TraceAbstraction took 13943.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:52,656 INFO L168 Benchmark]: Witness Printer took 65.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:52,658 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.43 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 948.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 398.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13943.84 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 206.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.3 MB). Peak memory consumption was 128.8 MB. Max. memory is 11.5 GB. * Witness Printer took 65.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. Result: SAFE, OverallTime: 13.8s, OverallIterations: 18, TraceHistogramMax: 15, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 439 SDtfs, 1305 SDslu, 990 SDs, 0 SdLazy, 2875 SolverSat, 314 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1058 GetRequests, 807 SyntacticMatches, 38 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 200 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1595 NumberOfCodeBlocks, 1306 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1563 ConstructedInterpolants, 312 QuantifiedInterpolants, 931419 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1856 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 3500/3920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...