./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_5.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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:46:22,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:22,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:22,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:22,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:22,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:22,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:22,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:22,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:22,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:22,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:22,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:22,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:22,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:22,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:22,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:22,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:22,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:22,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:22,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:22,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:22,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:22,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:22,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:22,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:22,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:22,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:22,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:22,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:22,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:22,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:22,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:22,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:22,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:22,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:22,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:22,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:22,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:22,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:22,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:22,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:22,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:46:22,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:22,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:22,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:22,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:22,257 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:22,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:22,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:22,258 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:22,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:22,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:22,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:22,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:22,259 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:22,260 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:22,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:22,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:22,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:22,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:22,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:22,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:22,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:22,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:22,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:22,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:22,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:22,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:22,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:22,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-11-28 02:46:22,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:22,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:22,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:22,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:22,636 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:22,637 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2019-11-28 02:46:22,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04a93b45/be420dfaa46b404ea1274b0b62ffd972/FLAG7e3ff358b [2019-11-28 02:46:23,211 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:23,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2019-11-28 02:46:23,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04a93b45/be420dfaa46b404ea1274b0b62ffd972/FLAG7e3ff358b [2019-11-28 02:46:23,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04a93b45/be420dfaa46b404ea1274b0b62ffd972 [2019-11-28 02:46:23,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:23,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:23,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:23,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:23,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:23,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483df1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23, skipping insertion in model container [2019-11-28 02:46:23,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:23,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:23,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:23,807 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:23,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:23,840 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:23,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23 WrapperNode [2019-11-28 02:46:23,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:23,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:23,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:23,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:23,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... [2019-11-28 02:46:23,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:23,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:23,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:23,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:23,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:24,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:24,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:24,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:24,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:24,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:24,281 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:24,282 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:24,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:24 BoogieIcfgContainer [2019-11-28 02:46:24,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:24,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:24,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:24,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:24,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:23" (1/3) ... [2019-11-28 02:46:24,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3eff8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:24, skipping insertion in model container [2019-11-28 02:46:24,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:23" (2/3) ... [2019-11-28 02:46:24,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3eff8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:24, skipping insertion in model container [2019-11-28 02:46:24,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:24" (3/3) ... [2019-11-28 02:46:24,301 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-28 02:46:24,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:24,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:24,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:24,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:24,354 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:24,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:24,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:24,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:24,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:24,354 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:24,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-28 02:46:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:46:24,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:24,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:24,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:24,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:24,394 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2019-11-28 02:46:24,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:24,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098776204] [2019-11-28 02:46:24,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:24,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098776204] [2019-11-28 02:46:24,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:24,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:24,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469754271] [2019-11-28 02:46:24,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:24,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:24,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:24,578 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-11-28 02:46:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:24,663 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2019-11-28 02:46:24,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:24,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 02:46:24,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:24,683 INFO L225 Difference]: With dead ends: 50 [2019-11-28 02:46:24,683 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:46:24,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:46:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-28 02:46:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:46:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2019-11-28 02:46:24,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2019-11-28 02:46:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:24,748 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2019-11-28 02:46:24,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2019-11-28 02:46:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:46:24,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:24,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:24,750 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2019-11-28 02:46:24,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:24,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958993569] [2019-11-28 02:46:24,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958993569] [2019-11-28 02:46:24,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:24,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:24,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139846984] [2019-11-28 02:46:24,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:24,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:24,834 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2019-11-28 02:46:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:24,873 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2019-11-28 02:46:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:24,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 02:46:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:24,876 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:46:24,876 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:46:24,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:46:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 02:46:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:46:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2019-11-28 02:46:24,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2019-11-28 02:46:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:24,891 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2019-11-28 02:46:24,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2019-11-28 02:46:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:24,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:24,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:24,896 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:24,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2019-11-28 02:46:24,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:24,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496642233] [2019-11-28 02:46:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:24,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496642233] [2019-11-28 02:46:24,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:24,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:24,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527434814] [2019-11-28 02:46:24,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:24,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:24,972 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2019-11-28 02:46:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,000 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-11-28 02:46:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,004 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:46:25,004 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 02:46:25,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 02:46:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-28 02:46:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 02:46:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2019-11-28 02:46:25,014 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2019-11-28 02:46:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,014 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2019-11-28 02:46:25,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2019-11-28 02:46:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:25,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,017 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2019-11-28 02:46:25,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233653528] [2019-11-28 02:46:25,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233653528] [2019-11-28 02:46:25,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731548480] [2019-11-28 02:46:25,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,085 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2019-11-28 02:46:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,102 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2019-11-28 02:46:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:25,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,104 INFO L225 Difference]: With dead ends: 74 [2019-11-28 02:46:25,104 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 02:46:25,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 02:46:25,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2019-11-28 02:46:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 02:46:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2019-11-28 02:46:25,113 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2019-11-28 02:46:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,113 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2019-11-28 02:46:25,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2019-11-28 02:46:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:46:25,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,115 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2019-11-28 02:46:25,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698119334] [2019-11-28 02:46:25,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698119334] [2019-11-28 02:46:25,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894273266] [2019-11-28 02:46:25,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,164 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2019-11-28 02:46:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,190 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2019-11-28 02:46:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 02:46:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,192 INFO L225 Difference]: With dead ends: 76 [2019-11-28 02:46:25,192 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 02:46:25,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 02:46:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-28 02:46:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 02:46:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2019-11-28 02:46:25,205 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2019-11-28 02:46:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,205 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2019-11-28 02:46:25,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2019-11-28 02:46:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,208 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2019-11-28 02:46:25,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751006863] [2019-11-28 02:46:25,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751006863] [2019-11-28 02:46:25,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505056712] [2019-11-28 02:46:25,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,246 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2019-11-28 02:46:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,268 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-11-28 02:46:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,271 INFO L225 Difference]: With dead ends: 78 [2019-11-28 02:46:25,271 INFO L226 Difference]: Without dead ends: 78 [2019-11-28 02:46:25,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-28 02:46:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-28 02:46:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 02:46:25,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2019-11-28 02:46:25,288 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2019-11-28 02:46:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,288 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2019-11-28 02:46:25,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2019-11-28 02:46:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,293 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2019-11-28 02:46:25,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475134948] [2019-11-28 02:46:25,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475134948] [2019-11-28 02:46:25,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229713737] [2019-11-28 02:46:25,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,359 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2019-11-28 02:46:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,381 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2019-11-28 02:46:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,384 INFO L225 Difference]: With dead ends: 130 [2019-11-28 02:46:25,384 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 02:46:25,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 02:46:25,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-11-28 02:46:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 02:46:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-11-28 02:46:25,394 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2019-11-28 02:46:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,395 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-11-28 02:46:25,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-11-28 02:46:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:25,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2019-11-28 02:46:25,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555492588] [2019-11-28 02:46:25,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555492588] [2019-11-28 02:46:25,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275474630] [2019-11-28 02:46:25,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,455 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2019-11-28 02:46:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,473 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2019-11-28 02:46:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,475 INFO L225 Difference]: With dead ends: 138 [2019-11-28 02:46:25,476 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 02:46:25,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 02:46:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-11-28 02:46:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 02:46:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2019-11-28 02:46:25,489 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2019-11-28 02:46:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,490 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2019-11-28 02:46:25,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2019-11-28 02:46:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:25,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,494 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2019-11-28 02:46:25,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389835614] [2019-11-28 02:46:25,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389835614] [2019-11-28 02:46:25,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112110711] [2019-11-28 02:46:25,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,558 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2019-11-28 02:46:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,579 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2019-11-28 02:46:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,581 INFO L225 Difference]: With dead ends: 142 [2019-11-28 02:46:25,581 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 02:46:25,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 02:46:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2019-11-28 02:46:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 02:46:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-11-28 02:46:25,592 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2019-11-28 02:46:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,593 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-11-28 02:46:25,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-11-28 02:46:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:25,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,595 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2019-11-28 02:46:25,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726694741] [2019-11-28 02:46:25,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726694741] [2019-11-28 02:46:25,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305618599] [2019-11-28 02:46:25,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,627 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2019-11-28 02:46:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,640 INFO L93 Difference]: Finished difference Result 234 states and 319 transitions. [2019-11-28 02:46:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,642 INFO L225 Difference]: With dead ends: 234 [2019-11-28 02:46:25,642 INFO L226 Difference]: Without dead ends: 234 [2019-11-28 02:46:25,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-28 02:46:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2019-11-28 02:46:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 02:46:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2019-11-28 02:46:25,654 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2019-11-28 02:46:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,654 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2019-11-28 02:46:25,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2019-11-28 02:46:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:25,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,657 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,657 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2019-11-28 02:46:25,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065511383] [2019-11-28 02:46:25,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065511383] [2019-11-28 02:46:25,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551824263] [2019-11-28 02:46:25,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,688 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2019-11-28 02:46:25,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,718 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2019-11-28 02:46:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:25,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,721 INFO L225 Difference]: With dead ends: 258 [2019-11-28 02:46:25,721 INFO L226 Difference]: Without dead ends: 258 [2019-11-28 02:46:25,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-28 02:46:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-28 02:46:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-28 02:46:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2019-11-28 02:46:25,741 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2019-11-28 02:46:25,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,741 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2019-11-28 02:46:25,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2019-11-28 02:46:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:25,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,743 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,744 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2019-11-28 02:46:25,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381734831] [2019-11-28 02:46:25,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381734831] [2019-11-28 02:46:25,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398003496] [2019-11-28 02:46:25,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,771 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2019-11-28 02:46:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,794 INFO L93 Difference]: Finished difference Result 266 states and 327 transitions. [2019-11-28 02:46:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,796 INFO L225 Difference]: With dead ends: 266 [2019-11-28 02:46:25,796 INFO L226 Difference]: Without dead ends: 266 [2019-11-28 02:46:25,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-28 02:46:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2019-11-28 02:46:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 02:46:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2019-11-28 02:46:25,807 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2019-11-28 02:46:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,807 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2019-11-28 02:46:25,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2019-11-28 02:46:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:25,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,810 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,810 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2019-11-28 02:46:25,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703683084] [2019-11-28 02:46:25,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703683084] [2019-11-28 02:46:25,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195628250] [2019-11-28 02:46:25,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,865 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2019-11-28 02:46:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,880 INFO L93 Difference]: Finished difference Result 424 states and 502 transitions. [2019-11-28 02:46:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,884 INFO L225 Difference]: With dead ends: 424 [2019-11-28 02:46:25,884 INFO L226 Difference]: Without dead ends: 424 [2019-11-28 02:46:25,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-28 02:46:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2019-11-28 02:46:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-28 02:46:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2019-11-28 02:46:25,899 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2019-11-28 02:46:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,899 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2019-11-28 02:46:25,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2019-11-28 02:46:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:25,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:25,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:25,904 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:25,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:25,905 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2019-11-28 02:46:25,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:25,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977149560] [2019-11-28 02:46:25,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:46:25,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977149560] [2019-11-28 02:46:25,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:25,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:25,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855857769] [2019-11-28 02:46:25,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:25,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:25,949 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2019-11-28 02:46:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:25,964 INFO L93 Difference]: Finished difference Result 486 states and 533 transitions. [2019-11-28 02:46:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:25,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:25,965 INFO L225 Difference]: With dead ends: 486 [2019-11-28 02:46:25,965 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:25,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-28 02:46:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:25,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-28 02:46:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:25,967 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:25,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:25,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:25,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:25 BoogieIcfgContainer [2019-11-28 02:46:25,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:25,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:25,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:25,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:25,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:24" (3/4) ... [2019-11-28 02:46:25,977 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:25,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:25,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:25,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:25,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:25,988 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:26,048 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:26,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:26,052 INFO L168 Benchmark]: Toolchain (without parser) took 2491.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 960.4 MB in the beginning and 982.2 MB in the end (delta: -21.8 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,054 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:26,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,056 INFO L168 Benchmark]: Boogie Preprocessor took 103.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,056 INFO L168 Benchmark]: RCFGBuilder took 337.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,058 INFO L168 Benchmark]: TraceAbstraction took 1688.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,058 INFO L168 Benchmark]: Witness Printer took 75.29 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 982.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:26,067 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 103.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1688.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.8 MB in the end (delta: 111.8 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. * Witness Printer took 75.29 ms. Allocated memory is still 1.2 GB. Free memory was 988.8 MB in the beginning and 982.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...