./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_7.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_7.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 ccd6d122756047ddb1225c106ac06a6748e14c22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:23,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:23,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:23,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:23,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:23,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:23,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:23,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:23,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:23,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:23,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:23,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:23,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:23,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:23,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:23,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:23,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:23,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:23,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:23,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:23,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:23,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:23,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:23,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:23,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:23,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:23,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:23,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:23,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:23,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:23,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:23,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:23,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:23,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:23,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:23,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:23,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:23,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:23,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:23,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:23,841 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:23,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:23,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:23,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:23,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:23,885 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:23,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:23,888 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:23,889 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:23,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:23,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:23,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:23,890 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:23,890 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:23,890 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:23,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:23,891 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:23,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:23,893 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:23,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:23,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:23,894 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:23,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:23,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:23,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:23,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:23,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:23,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:23,897 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-11-28 02:46:24,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:24,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:24,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:24,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:24,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:24,266 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2019-11-28 02:46:24,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09229fe73/3e6fabac4e5646bb8f03dd59bd048e9e/FLAGf23074622 [2019-11-28 02:46:24,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:24,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2019-11-28 02:46:24,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09229fe73/3e6fabac4e5646bb8f03dd59bd048e9e/FLAGf23074622 [2019-11-28 02:46:25,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09229fe73/3e6fabac4e5646bb8f03dd59bd048e9e [2019-11-28 02:46:25,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:25,169 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:25,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:25,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:25,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:25,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:25" (1/1) ... [2019-11-28 02:46:25,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e961de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:25, skipping insertion in model container [2019-11-28 02:46:25,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:25" (1/1) ... [2019-11-28 02:46:25,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:25,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:25,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:25,449 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:25,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:25,588 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:25,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:25 WrapperNode [2019-11-28 02:46:25,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:25,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:25,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:25,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:25,604 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:25" (1/1) ... [2019-11-28 02:46:25,605 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:25" (1/1) ... [2019-11-28 02:46:25,612 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:25" (1/1) ... [2019-11-28 02:46:25,612 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:25" (1/1) ... [2019-11-28 02:46:25,630 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:25" (1/1) ... [2019-11-28 02:46:25,636 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:25" (1/1) ... [2019-11-28 02:46:25,638 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:25" (1/1) ... [2019-11-28 02:46:25,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:25,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:25,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:25,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:25,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:25" (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:25,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:25,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:25,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:25,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:25,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:25,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:25,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:26,008 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:26,008 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:26,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:26 BoogieIcfgContainer [2019-11-28 02:46:26,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:26,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:26,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:26,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:25" (1/3) ... [2019-11-28 02:46:26,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34aa6b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:26, skipping insertion in model container [2019-11-28 02:46:26,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:25" (2/3) ... [2019-11-28 02:46:26,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34aa6b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:26, skipping insertion in model container [2019-11-28 02:46:26,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:26" (3/3) ... [2019-11-28 02:46:26,030 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-28 02:46:26,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:26,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:26,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:26,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:26,098 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:26,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:26,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:26,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:26,099 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:26,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:26,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-28 02:46:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:26,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,130 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:26,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-11-28 02:46:26,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061747343] [2019-11-28 02:46:26,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,317 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:26,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061747343] [2019-11-28 02:46:26,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639539953] [2019-11-28 02:46:26,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,346 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-28 02:46:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,406 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. [2019-11-28 02:46:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,418 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:46:26,418 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:46:26,420 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:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:46:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-11-28 02:46:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:46:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-11-28 02:46:26,461 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-11-28 02:46:26,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,462 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-11-28 02:46:26,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-11-28 02:46:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 02:46:26,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,464 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:26,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-11-28 02:46:26,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032740820] [2019-11-28 02:46:26,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,534 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:26,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032740820] [2019-11-28 02:46:26,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390138743] [2019-11-28 02:46:26,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,539 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-11-28 02:46:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,566 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2019-11-28 02:46:26,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 02:46:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,568 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:46:26,568 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:46:26,569 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:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:46:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-11-28 02:46:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 02:46:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-11-28 02:46:26,578 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-11-28 02:46:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,578 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-11-28 02:46:26,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-11-28 02:46:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:26,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,580 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:26,580 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-11-28 02:46:26,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302447103] [2019-11-28 02:46:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,657 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:26,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302447103] [2019-11-28 02:46:26,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181605358] [2019-11-28 02:46:26,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,665 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-11-28 02:46:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,690 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-11-28 02:46:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,693 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:46:26,693 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 02:46:26,693 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:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 02:46:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-28 02:46:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 02:46:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-11-28 02:46:26,702 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-11-28 02:46:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,703 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-11-28 02:46:26,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-11-28 02:46:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:26,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,704 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:26,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-11-28 02:46:26,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450239485] [2019-11-28 02:46:26,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,758 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:26,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450239485] [2019-11-28 02:46:26,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911405747] [2019-11-28 02:46:26,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,760 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-11-28 02:46:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,797 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2019-11-28 02:46:26,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,803 INFO L225 Difference]: With dead ends: 98 [2019-11-28 02:46:26,803 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 02:46:26,804 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:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 02:46:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-11-28 02:46:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-28 02:46:26,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-11-28 02:46:26,817 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-11-28 02:46:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,818 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-11-28 02:46:26,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-11-28 02:46:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:26,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,819 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:26,820 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,820 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-11-28 02:46:26,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393346142] [2019-11-28 02:46:26,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,878 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:26,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393346142] [2019-11-28 02:46:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459269133] [2019-11-28 02:46:26,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,885 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-11-28 02:46:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:26,925 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2019-11-28 02:46:26,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:26,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:26,929 INFO L225 Difference]: With dead ends: 100 [2019-11-28 02:46:26,929 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 02:46:26,930 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:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 02:46:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-11-28 02:46:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 02:46:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-11-28 02:46:26,941 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-11-28 02:46:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:26,941 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-11-28 02:46:26,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-11-28 02:46:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:26,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:26,943 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:26,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-11-28 02:46:26,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:26,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738725711] [2019-11-28 02:46:26,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:26,990 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:26,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738725711] [2019-11-28 02:46:26,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:26,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856758146] [2019-11-28 02:46:26,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:26,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:26,993 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-11-28 02:46:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,007 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2019-11-28 02:46:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,010 INFO L225 Difference]: With dead ends: 102 [2019-11-28 02:46:27,010 INFO L226 Difference]: Without dead ends: 102 [2019-11-28 02:46:27,010 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:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-28 02:46:27,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-28 02:46:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 02:46:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-11-28 02:46:27,019 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-11-28 02:46:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,020 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-11-28 02:46:27,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-11-28 02:46:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:27,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,021 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:27,022 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-11-28 02:46:27,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51146284] [2019-11-28 02:46:27,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,075 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:27,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51146284] [2019-11-28 02:46:27,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482175532] [2019-11-28 02:46:27,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,077 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-11-28 02:46:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,098 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2019-11-28 02:46:27,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,104 INFO L225 Difference]: With dead ends: 178 [2019-11-28 02:46:27,104 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 02:46:27,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:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 02:46:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-11-28 02:46:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 02:46:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-11-28 02:46:27,119 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-11-28 02:46:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,119 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-11-28 02:46:27,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-11-28 02:46:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:27,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,124 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:27,124 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-11-28 02:46:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202887654] [2019-11-28 02:46:27,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,155 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:27,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202887654] [2019-11-28 02:46:27,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101073315] [2019-11-28 02:46:27,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,157 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-11-28 02:46:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,180 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2019-11-28 02:46:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,183 INFO L225 Difference]: With dead ends: 186 [2019-11-28 02:46:27,183 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 02:46:27,183 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:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 02:46:27,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-11-28 02:46:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 02:46:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-11-28 02:46:27,209 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-11-28 02:46:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,209 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-11-28 02:46:27,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-11-28 02:46:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:27,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-11-28 02:46:27,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839816213] [2019-11-28 02:46:27,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,259 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:27,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839816213] [2019-11-28 02:46:27,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733610111] [2019-11-28 02:46:27,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,264 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-11-28 02:46:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,279 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2019-11-28 02:46:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,281 INFO L225 Difference]: With dead ends: 190 [2019-11-28 02:46:27,282 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 02:46:27,282 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:27,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 02:46:27,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-11-28 02:46:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-28 02:46:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-11-28 02:46:27,292 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-11-28 02:46:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,293 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-11-28 02:46:27,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-11-28 02:46:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:27,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,296 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-11-28 02:46:27,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230138607] [2019-11-28 02:46:27,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,320 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:27,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230138607] [2019-11-28 02:46:27,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296256300] [2019-11-28 02:46:27,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,322 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-11-28 02:46:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,336 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2019-11-28 02:46:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,339 INFO L225 Difference]: With dead ends: 330 [2019-11-28 02:46:27,339 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 02:46:27,339 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:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 02:46:27,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-11-28 02:46:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 02:46:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-11-28 02:46:27,349 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-11-28 02:46:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,350 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-11-28 02:46:27,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-11-28 02:46:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:27,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-11-28 02:46:27,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748174350] [2019-11-28 02:46:27,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,380 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:27,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748174350] [2019-11-28 02:46:27,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146805845] [2019-11-28 02:46:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,382 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-11-28 02:46:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,405 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2019-11-28 02:46:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,408 INFO L225 Difference]: With dead ends: 354 [2019-11-28 02:46:27,408 INFO L226 Difference]: Without dead ends: 354 [2019-11-28 02:46:27,409 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:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-28 02:46:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-11-28 02:46:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-28 02:46:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-11-28 02:46:27,420 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-11-28 02:46:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,421 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-11-28 02:46:27,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,421 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-11-28 02:46:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:27,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,424 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-11-28 02:46:27,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507079904] [2019-11-28 02:46:27,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,457 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:27,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507079904] [2019-11-28 02:46:27,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711166619] [2019-11-28 02:46:27,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,460 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-11-28 02:46:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,472 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2019-11-28 02:46:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,475 INFO L225 Difference]: With dead ends: 362 [2019-11-28 02:46:27,475 INFO L226 Difference]: Without dead ends: 362 [2019-11-28 02:46:27,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:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-28 02:46:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-11-28 02:46:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-28 02:46:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-11-28 02:46:27,487 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-11-28 02:46:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,489 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-11-28 02:46:27,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-11-28 02:46:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:27,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,494 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-11-28 02:46:27,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504459888] [2019-11-28 02:46:27,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,525 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:27,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504459888] [2019-11-28 02:46:27,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981437429] [2019-11-28 02:46:27,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,528 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-11-28 02:46:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,546 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2019-11-28 02:46:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,550 INFO L225 Difference]: With dead ends: 618 [2019-11-28 02:46:27,551 INFO L226 Difference]: Without dead ends: 618 [2019-11-28 02:46:27,551 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:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-11-28 02:46:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-11-28 02:46:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-28 02:46:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-11-28 02:46:27,570 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-11-28 02:46:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,571 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-11-28 02:46:27,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-11-28 02:46:27,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:27,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-11-28 02:46:27,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219668460] [2019-11-28 02:46:27,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,597 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:27,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219668460] [2019-11-28 02:46:27,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424533925] [2019-11-28 02:46:27,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,600 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-11-28 02:46:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,622 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2019-11-28 02:46:27,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,627 INFO L225 Difference]: With dead ends: 682 [2019-11-28 02:46:27,627 INFO L226 Difference]: Without dead ends: 682 [2019-11-28 02:46:27,628 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:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-28 02:46:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-28 02:46:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-28 02:46:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-11-28 02:46:27,647 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-11-28 02:46:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,648 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-11-28 02:46:27,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-11-28 02:46:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:27,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,651 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-11-28 02:46:27,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394536222] [2019-11-28 02:46:27,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,673 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:27,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394536222] [2019-11-28 02:46:27,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089665766] [2019-11-28 02:46:27,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,676 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-11-28 02:46:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,699 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2019-11-28 02:46:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,704 INFO L225 Difference]: With dead ends: 698 [2019-11-28 02:46:27,704 INFO L226 Difference]: Without dead ends: 698 [2019-11-28 02:46:27,706 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:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-11-28 02:46:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-11-28 02:46:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-28 02:46:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-11-28 02:46:27,724 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-11-28 02:46:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,725 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-11-28 02:46:27,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-11-28 02:46:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:27,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,727 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-11-28 02:46:27,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69844112] [2019-11-28 02:46:27,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,757 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:27,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69844112] [2019-11-28 02:46:27,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626463326] [2019-11-28 02:46:27,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,762 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-11-28 02:46:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,781 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2019-11-28 02:46:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,788 INFO L225 Difference]: With dead ends: 1162 [2019-11-28 02:46:27,788 INFO L226 Difference]: Without dead ends: 1162 [2019-11-28 02:46:27,788 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:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-28 02:46:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-11-28 02:46:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-11-28 02:46:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-11-28 02:46:27,817 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-11-28 02:46:27,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,817 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-11-28 02:46:27,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-11-28 02:46:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:27,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,822 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-11-28 02:46:27,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368230503] [2019-11-28 02:46:27,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,853 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:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368230503] [2019-11-28 02:46:27,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657894380] [2019-11-28 02:46:27,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,860 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-11-28 02:46:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,882 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2019-11-28 02:46:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,889 INFO L225 Difference]: With dead ends: 1322 [2019-11-28 02:46:27,889 INFO L226 Difference]: Without dead ends: 1322 [2019-11-28 02:46:27,890 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:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-11-28 02:46:27,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-11-28 02:46:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-11-28 02:46:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-11-28 02:46:27,925 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-11-28 02:46:27,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,925 INFO L462 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-11-28 02:46:27,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-11-28 02:46:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:27,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:27,928 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,929 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-11-28 02:46:27,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515623965] [2019-11-28 02:46:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,958 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:27,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515623965] [2019-11-28 02:46:27,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678968531] [2019-11-28 02:46:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,962 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-11-28 02:46:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,986 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2019-11-28 02:46:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,993 INFO L225 Difference]: With dead ends: 1354 [2019-11-28 02:46:27,994 INFO L226 Difference]: Without dead ends: 1354 [2019-11-28 02:46:27,994 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:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-28 02:46:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-11-28 02:46:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-11-28 02:46:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-11-28 02:46:28,028 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-11-28 02:46:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,029 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-11-28 02:46:28,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-11-28 02:46:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:28,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:28,034 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-11-28 02:46:28,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847307899] [2019-11-28 02:46:28,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,071 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:28,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847307899] [2019-11-28 02:46:28,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822687344] [2019-11-28 02:46:28,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,076 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-11-28 02:46:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,105 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2019-11-28 02:46:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,119 INFO L225 Difference]: With dead ends: 2184 [2019-11-28 02:46:28,120 INFO L226 Difference]: Without dead ends: 2184 [2019-11-28 02:46:28,120 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:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-11-28 02:46:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-11-28 02:46:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-28 02:46:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-11-28 02:46:28,199 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-11-28 02:46:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,200 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-11-28 02:46:28,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-11-28 02:46:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:28,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:46:28,207 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-11-28 02:46:28,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442772180] [2019-11-28 02:46:28,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,241 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:28,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442772180] [2019-11-28 02:46:28,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966176202] [2019-11-28 02:46:28,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,243 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-11-28 02:46:28,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,277 INFO L93 Difference]: Finished difference Result 2566 states and 2757 transitions. [2019-11-28 02:46:28,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,278 INFO L225 Difference]: With dead ends: 2566 [2019-11-28 02:46:28,278 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:28,279 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:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:28,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:28,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-28 02:46:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,280 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:28,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:28,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:28,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:28 BoogieIcfgContainer [2019-11-28 02:46:28,289 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:28,290 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:28,290 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:28,290 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:28,291 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:26" (3/4) ... [2019-11-28 02:46:28,296 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:28,307 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:28,308 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:28,317 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:28,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:28,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:28,443 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:28,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:28,445 INFO L168 Benchmark]: Toolchain (without parser) took 3276.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.7 MB in the beginning and 865.0 MB in the end (delta: 96.8 MB). Peak memory consumption was 239.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,445 INFO L168 Benchmark]: CDTParser took 1.16 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:28,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,450 INFO L168 Benchmark]: Boogie Preprocessor took 50.59 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,450 INFO L168 Benchmark]: RCFGBuilder took 372.34 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.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,450 INFO L168 Benchmark]: TraceAbstraction took 2275.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.6 MB in the end (delta: 240.9 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,451 INFO L168 Benchmark]: Witness Printer took 152.74 ms. Allocated memory is still 1.2 GB. Free memory was 871.6 MB in the beginning and 865.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:28,456 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 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 417.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.59 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.34 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.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2275.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 871.6 MB in the end (delta: 240.9 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. * Witness Printer took 152.74 ms. Allocated memory is still 1.2 GB. Free memory was 871.6 MB in the beginning and 865.0 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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, 35 locations, 1 error locations. Result: SAFE, OverallTime: 2.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...