./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.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-0ed9222-m [2019-01-13 22:55:09,252 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:55:09,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:55:09,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:55:09,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:55:09,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:55:09,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:55:09,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:55:09,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:55:09,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:55:09,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:55:09,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:55:09,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:55:09,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:55:09,278 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:55:09,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:55:09,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:55:09,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:55:09,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:55:09,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:55:09,287 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:55:09,288 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:55:09,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:55:09,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:55:09,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:55:09,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:55:09,293 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:55:09,294 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:55:09,295 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:55:09,296 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:55:09,297 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:55:09,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:55:09,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:55:09,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:55:09,299 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:55:09,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:55:09,300 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:55:09,319 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:55:09,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:55:09,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:55:09,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:55:09,321 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:55:09,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:55:09,322 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:55:09,323 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:55:09,323 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:55:09,323 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:55:09,323 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:55:09,323 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:55:09,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:55:09,324 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:55:09,325 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:55:09,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:55:09,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:55:09,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:55:09,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:55:09,326 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:55:09,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:55:09,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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-01-13 22:55:09,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:55:09,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:55:09,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:55:09,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:55:09,383 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:55:09,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-13 22:55:09,439 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df9d8688/ddb8c071fe84402bbd56920a16e8bdb1/FLAG739127077 [2019-01-13 22:55:09,902 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:55:09,903 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-13 22:55:09,909 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df9d8688/ddb8c071fe84402bbd56920a16e8bdb1/FLAG739127077 [2019-01-13 22:55:10,250 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df9d8688/ddb8c071fe84402bbd56920a16e8bdb1 [2019-01-13 22:55:10,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:55:10,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:55:10,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:10,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:55:10,263 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:55:10,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bc7883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10, skipping insertion in model container [2019-01-13 22:55:10,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:55:10,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:55:10,470 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:10,482 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:55:10,502 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:10,519 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:55:10,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10 WrapperNode [2019-01-13 22:55:10,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:10,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:55:10,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:55:10,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:55:10,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (1/1) ... [2019-01-13 22:55:10,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:55:10,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:55:10,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:55:10,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:55:10,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (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-01-13 22:55:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:55:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:55:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-13 22:55:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:55:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-13 22:55:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:55:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:55:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:55:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:55:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:55:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:55:10,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:55:11,151 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:55:11,152 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-13 22:55:11,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:11 BoogieIcfgContainer [2019-01-13 22:55:11,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:55:11,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:55:11,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:55:11,158 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:55:11,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:55:10" (1/3) ... [2019-01-13 22:55:11,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227540fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:11, skipping insertion in model container [2019-01-13 22:55:11,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:10" (2/3) ... [2019-01-13 22:55:11,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@227540fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:11, skipping insertion in model container [2019-01-13 22:55:11,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:11" (3/3) ... [2019-01-13 22:55:11,163 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2019-01-13 22:55:11,171 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:55:11,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-13 22:55:11,190 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-13 22:55:11,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:55:11,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:55:11,214 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:55:11,214 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:55:11,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:55:11,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:55:11,215 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:55:11,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:55:11,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:55:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-13 22:55:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:55:11,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:11,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:11,246 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-13 22:55:11,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:11,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:11,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:11,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:11,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:11,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:55:11,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:11,444 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-13 22:55:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:11,583 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-13 22:55:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:11,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:55:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:11,594 INFO L225 Difference]: With dead ends: 58 [2019-01-13 22:55:11,595 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:55:11,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:11,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:55:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-13 22:55:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 22:55:11,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-13 22:55:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:11,635 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 22:55:11,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 22:55:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:55:11,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:11,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:11,637 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-13 22:55:11,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:11,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:11,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:11,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:11,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:11,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:11,809 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2019-01-13 22:55:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:12,141 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-13 22:55:12,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:12,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-13 22:55:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:12,143 INFO L225 Difference]: With dead ends: 59 [2019-01-13 22:55:12,143 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:55:12,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:55:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-01-13 22:55:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:55:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-13 22:55:12,152 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-01-13 22:55:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:12,153 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-13 22:55:12,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-13 22:55:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:12,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:12,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:12,154 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-13 22:55:12,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:12,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:12,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:12,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:12,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:12,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:12,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:12,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:12,245 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2019-01-13 22:55:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:12,338 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-13 22:55:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:12,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-13 22:55:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:12,342 INFO L225 Difference]: With dead ends: 43 [2019-01-13 22:55:12,342 INFO L226 Difference]: Without dead ends: 43 [2019-01-13 22:55:12,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-13 22:55:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-13 22:55:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 22:55:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-13 22:55:12,349 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-01-13 22:55:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:12,350 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-13 22:55:12,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-13 22:55:12,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:12,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:12,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:12,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-01-13 22:55:12,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:12,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:12,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:12,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:12,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:12,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:12,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:12,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:12,437 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-13 22:55:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:12,582 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-13 22:55:12,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:12,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-13 22:55:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:12,584 INFO L225 Difference]: With dead ends: 47 [2019-01-13 22:55:12,584 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 22:55:12,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 22:55:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-13 22:55:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-13 22:55:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-13 22:55:12,592 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-01-13 22:55:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:12,592 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-13 22:55:12,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-13 22:55:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-13 22:55:12,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:12,594 INFO L402 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-01-13 22:55:12,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-01-13 22:55:12,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:12,689 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:12,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:12,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:12,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-13 22:55:12,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:12,796 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-01-13 22:55:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:12,946 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-13 22:55:12,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:55:12,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-13 22:55:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:12,949 INFO L225 Difference]: With dead ends: 69 [2019-01-13 22:55:12,950 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:55:12,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:55:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-01-13 22:55:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-13 22:55:12,964 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-01-13 22:55:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:12,966 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-13 22:55:12,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-13 22:55:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-13 22:55:12,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:12,967 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:12,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-01-13 22:55:12,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:12,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:12,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:12,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:13,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:13,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:13,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-13 22:55:13,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-01-13 22:55:13,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:55:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:55:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:13,543 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2019-01-13 22:55:13,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:13,961 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-13 22:55:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:55:13,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-01-13 22:55:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:13,966 INFO L225 Difference]: With dead ends: 101 [2019-01-13 22:55:13,966 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 22:55:13,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:55:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 22:55:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2019-01-13 22:55:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-13 22:55:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-01-13 22:55:13,981 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-01-13 22:55:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:13,981 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-01-13 22:55:13,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:55:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-01-13 22:55:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:55:13,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:13,986 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:13,986 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-01-13 22:55:13,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:13,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:13,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:13,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:14,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:14,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:14,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:14,179 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:55:14,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-13 22:55:14,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:14,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:14,226 INFO L267 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-01-13 22:55:14,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-01-13 22:55:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2019-01-13 22:55:14,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:55:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:55:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:14,312 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2019-01-13 22:55:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:14,454 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-01-13 22:55:14,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:14,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-13 22:55:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:14,457 INFO L225 Difference]: With dead ends: 53 [2019-01-13 22:55:14,457 INFO L226 Difference]: Without dead ends: 53 [2019-01-13 22:55:14,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-13 22:55:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-13 22:55:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-13 22:55:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-01-13 22:55:14,465 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-01-13 22:55:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:14,465 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-01-13 22:55:14,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:55:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-01-13 22:55:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-13 22:55:14,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:14,466 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:14,467 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-01-13 22:55:14,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:14,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:14,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:14,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:14,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:14,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:14,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:14,733 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:55:14,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:14,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2019-01-13 22:55:14,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-13 22:55:14,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:55:14,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-13 22:55:14,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2019-01-13 22:55:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:14,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:14,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-13 22:55:14,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:14,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:14,954 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states. [2019-01-13 22:55:15,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:15,346 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-01-13 22:55:15,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:55:15,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-01-13 22:55:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:15,349 INFO L225 Difference]: With dead ends: 55 [2019-01-13 22:55:15,349 INFO L226 Difference]: Without dead ends: 55 [2019-01-13 22:55:15,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:55:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-13 22:55:15,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-13 22:55:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-13 22:55:15,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-01-13 22:55:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:15,354 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-13 22:55:15,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-13 22:55:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:55:15,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:15,355 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:15,356 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:15,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-01-13 22:55:15,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:15,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:15,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:15,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:15,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:15,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:15,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:15,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:15,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:15,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-13 22:55:15,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:15,672 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2019-01-13 22:55:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:16,111 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-13 22:55:16,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:55:16,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-13 22:55:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:16,113 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:55:16,113 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:55:16,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:55:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-01-13 22:55:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-13 22:55:16,118 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2019-01-13 22:55:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:16,120 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-13 22:55:16,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-13 22:55:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:55:16,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:16,121 INFO L402 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-01-13 22:55:16,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-01-13 22:55:16,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:16,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:16,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:16,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:16,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:16,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:16,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-13 22:55:16,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-13 22:55:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-13 22:55:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-13 22:55:16,917 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 11 states. [2019-01-13 22:55:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:17,171 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-13 22:55:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:55:17,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-01-13 22:55:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:17,174 INFO L225 Difference]: With dead ends: 79 [2019-01-13 22:55:17,174 INFO L226 Difference]: Without dead ends: 79 [2019-01-13 22:55:17,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-13 22:55:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-01-13 22:55:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:55:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-01-13 22:55:17,181 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2019-01-13 22:55:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:17,182 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-01-13 22:55:17,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-13 22:55:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-01-13 22:55:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 22:55:17,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:17,183 INFO L402 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-01-13 22:55:17,185 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2019-01-13 22:55:17,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:17,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:17,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:17,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:55:17,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:17,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:17,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:17,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:17,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 22:55:17,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:17,385 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:55:17,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:17,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2019-01-13 22:55:17,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:17,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:17,432 INFO L267 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-01-13 22:55:17,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-13 22:55:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:55:17,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:17,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-13 22:55:17,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:55:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:55:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:55:17,861 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 8 states. [2019-01-13 22:55:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:18,137 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2019-01-13 22:55:18,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:18,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-13 22:55:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:18,140 INFO L225 Difference]: With dead ends: 67 [2019-01-13 22:55:18,140 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:55:18,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:55:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2019-01-13 22:55:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-13 22:55:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-01-13 22:55:18,146 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 31 [2019-01-13 22:55:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:18,147 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-01-13 22:55:18,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:55:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-01-13 22:55:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-13 22:55:18,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:18,148 INFO L402 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-01-13 22:55:18,148 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:18,149 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2019-01-13 22:55:18,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:18,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:55:18,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:18,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:18,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:18,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:55:18,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:18,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-13 22:55:18,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:55:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:55:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:18,385 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2019-01-13 22:55:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:18,546 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2019-01-13 22:55:18,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:18,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-13 22:55:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:18,548 INFO L225 Difference]: With dead ends: 93 [2019-01-13 22:55:18,549 INFO L226 Difference]: Without dead ends: 93 [2019-01-13 22:55:18,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-13 22:55:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2019-01-13 22:55:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-13 22:55:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2019-01-13 22:55:18,554 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 37 [2019-01-13 22:55:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:18,558 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2019-01-13 22:55:18,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:55:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2019-01-13 22:55:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-13 22:55:18,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:18,559 INFO L402 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-01-13 22:55:18,560 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2019-01-13 22:55:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-13 22:55:18,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:18,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:18,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:55:18,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:18,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-13 22:55:18,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:18,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2019-01-13 22:55:18,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 22:55:18,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 22:55:18,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:55:18,942 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 15 states. [2019-01-13 22:55:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:19,289 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-13 22:55:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:55:19,290 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2019-01-13 22:55:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:19,292 INFO L225 Difference]: With dead ends: 117 [2019-01-13 22:55:19,293 INFO L226 Difference]: Without dead ends: 117 [2019-01-13 22:55:19,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-01-13 22:55:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-13 22:55:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-01-13 22:55:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-13 22:55:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-01-13 22:55:19,299 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 43 [2019-01-13 22:55:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:19,299 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-01-13 22:55:19,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 22:55:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-01-13 22:55:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 22:55:19,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:19,301 INFO L402 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-01-13 22:55:19,301 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:19,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2019-01-13 22:55:19,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:19,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:19,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-13 22:55:20,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:20,350 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:20,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:55:20,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:20,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-13 22:55:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:20,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2019-01-13 22:55:20,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:55:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:55:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:55:20,808 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 13 states. [2019-01-13 22:55:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:21,695 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-01-13 22:55:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-13 22:55:21,696 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-13 22:55:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:21,697 INFO L225 Difference]: With dead ends: 122 [2019-01-13 22:55:21,697 INFO L226 Difference]: Without dead ends: 116 [2019-01-13 22:55:21,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:55:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-13 22:55:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-01-13 22:55:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-13 22:55:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2019-01-13 22:55:21,702 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 47 [2019-01-13 22:55:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:21,703 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2019-01-13 22:55:21,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:55:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2019-01-13 22:55:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-13 22:55:21,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:21,704 INFO L402 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-01-13 22:55:21,705 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2019-01-13 22:55:21,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:21,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:21,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-13 22:55:21,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:21,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:21,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:55:22,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 22:55:22,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:22,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:22,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 22:55:22,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:22,031 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:55:22,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:22,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 21 [2019-01-13 22:55:22,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:22,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:22,057 INFO L267 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-01-13 22:55:22,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-01-13 22:55:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-13 22:55:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2019-01-13 22:55:22,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:55:22,392 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 12 states. [2019-01-13 22:55:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:22,877 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-01-13 22:55:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:55:22,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-01-13 22:55:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:22,883 INFO L225 Difference]: With dead ends: 99 [2019-01-13 22:55:22,883 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 22:55:22,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:55:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 22:55:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-13 22:55:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-13 22:55:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2019-01-13 22:55:22,889 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 52 [2019-01-13 22:55:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:22,889 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2019-01-13 22:55:22,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2019-01-13 22:55:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-13 22:55:22,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:22,891 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:22,891 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash 267240299, now seen corresponding path program 1 times [2019-01-13 22:55:22,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:22,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-13 22:55:23,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:23,089 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:23,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-13 22:55:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:23,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-01-13 22:55:23,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-13 22:55:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-13 22:55:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:55:23,374 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2019-01-13 22:55:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:23,843 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2019-01-13 22:55:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:55:23,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2019-01-13 22:55:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:23,848 INFO L225 Difference]: With dead ends: 155 [2019-01-13 22:55:23,848 INFO L226 Difference]: Without dead ends: 152 [2019-01-13 22:55:23,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-01-13 22:55:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-13 22:55:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2019-01-13 22:55:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-13 22:55:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-01-13 22:55:23,853 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 82 [2019-01-13 22:55:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:23,854 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-01-13 22:55:23,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-13 22:55:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-01-13 22:55:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 22:55:23,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:23,857 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:23,857 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-13 22:55:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash -311092151, now seen corresponding path program 2 times [2019-01-13 22:55:23,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:23,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:23,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:23,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:23,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-13 22:55:23,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:23,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:23,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:24,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:24,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:24,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:24,172 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 22:55:24,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:24,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:24,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:24,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,194 INFO L267 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-01-13 22:55:24,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:24,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:24,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:24,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:24,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,292 INFO L267 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-01-13 22:55:24,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:24,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:24,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:24,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,452 INFO L267 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-01-13 22:55:24,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:24,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:24,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:24,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:24,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,559 INFO L267 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-01-13 22:55:24,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:24,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:24,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:24,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:24,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:24,635 INFO L267 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-01-13 22:55:24,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-01-13 22:55:25,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:25,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-01-13 22:55:25,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2019-01-13 22:55:25,431 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2019-01-13 22:55:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:26,035 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2019-01-13 22:55:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 22:55:26,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-01-13 22:55:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:26,037 INFO L225 Difference]: With dead ends: 142 [2019-01-13 22:55:26,037 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:55:26,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2019-01-13 22:55:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:55:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:55:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:55:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:55:26,041 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2019-01-13 22:55:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:26,041 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:55:26,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:55:26,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:55:26,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:55:26 BoogieIcfgContainer [2019-01-13 22:55:26,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:55:26,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:55:26,051 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:55:26,052 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:55:26,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:11" (3/4) ... [2019-01-13 22:55:26,058 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:55:26,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:55:26,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-13 22:55:26,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:55:26,076 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-13 22:55:26,077 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-13 22:55:26,077 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 22:55:26,078 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:55:26,124 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:55:26,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:55:26,125 INFO L168 Benchmark]: Toolchain (without parser) took 15869.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 951.4 MB in the beginning and 959.7 MB in the end (delta: -8.3 MB). Peak memory consumption was 280.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:26,127 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:26,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:26,128 INFO L168 Benchmark]: Boogie Preprocessor took 41.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:26,128 INFO L168 Benchmark]: RCFGBuilder took 591.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:26,129 INFO L168 Benchmark]: TraceAbstraction took 14896.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 133.0 MB). Peak memory consumption was 296.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:26,131 INFO L168 Benchmark]: Witness Printer took 72.88 ms. Allocated memory is still 1.3 GB. Free memory is still 959.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:26,135 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 261.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.89 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 591.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14896.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 133.0 MB). Peak memory consumption was 296.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.88 ms. Allocated memory is still 1.3 GB. Free memory is still 959.7 MB. 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]: 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: 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 - 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 - 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. SAFE Result, 14.8s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 1071 SDslu, 1228 SDs, 0 SdLazy, 2176 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 501 SyntacticMatches, 27 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 227 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1115 ConstructedInterpolants, 152 QuantifiedInterpolants, 379260 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1660 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 1135/1320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...