./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 f2cbbf56a13532141372a32a461d64a9d1351c0e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:46:25,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:46:25,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:46:25,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:46:25,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:46:25,296 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:46:25,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:46:25,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:46:25,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:46:25,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:46:25,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:46:25,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:46:25,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:46:25,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:46:25,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:46:25,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:46:25,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:46:25,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:46:25,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:46:25,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:46:25,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:46:25,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:46:25,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:46:25,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:46:25,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:46:25,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:46:25,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:46:25,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:46:25,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:46:25,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:46:25,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:46:25,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:46:25,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:46:25,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:46:25,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:46:25,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:46:25,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:46:25,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:46:25,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:46:25,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:46:25,356 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:25,370 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:46:25,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:46:25,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:46:25,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:46:25,372 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:46:25,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:46:25,373 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:46:25,373 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:46:25,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:46:25,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:46:25,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:46:25,374 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:46:25,374 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:46:25,374 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:46:25,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:46:25,375 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:46:25,375 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:46:25,376 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:46:25,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:46:25,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:46:25,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:46:25,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:46:25,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:46:25,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:46:25,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:46:25,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:46:25,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:46:25,378 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-11-28 02:46:25,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:46:25,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:46:25,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:46:25,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:46:25,736 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:46:25,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 02:46:25,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15abac81b/dfd4ec99ed4f4caf8626c133c2ed549d/FLAGe4ee7f722 [2019-11-28 02:46:26,309 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:46:26,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2019-11-28 02:46:26,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15abac81b/dfd4ec99ed4f4caf8626c133c2ed549d/FLAGe4ee7f722 [2019-11-28 02:46:26,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15abac81b/dfd4ec99ed4f4caf8626c133c2ed549d [2019-11-28 02:46:26,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:46:26,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:46:26,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:26,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:46:26,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:46:26,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:26" (1/1) ... [2019-11-28 02:46:26,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5562b866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:26, skipping insertion in model container [2019-11-28 02:46:26,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:46:26" (1/1) ... [2019-11-28 02:46:26,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:46:26,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:46:26,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:26,925 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:46:26,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:46:27,024 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:46:27,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:27 WrapperNode [2019-11-28 02:46:27,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:46:27,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:46:27,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:46:27,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:46:27,036 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:27" (1/1) ... [2019-11-28 02:46:27,036 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:27" (1/1) ... [2019-11-28 02:46:27,041 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:27" (1/1) ... [2019-11-28 02:46:27,042 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:27" (1/1) ... [2019-11-28 02:46:27,047 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:27" (1/1) ... [2019-11-28 02:46:27,061 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:27" (1/1) ... [2019-11-28 02:46:27,063 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:27" (1/1) ... [2019-11-28 02:46:27,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:46:27,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:46:27,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:46:27,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:46:27,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:27" (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:27,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:46:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:46:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:46:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 02:46:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:46:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:46:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:46:27,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:46:27,452 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:46:27,453 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 02:46:27,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:27 BoogieIcfgContainer [2019-11-28 02:46:27,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:46:27,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:46:27,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:46:27,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:46:27,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:46:26" (1/3) ... [2019-11-28 02:46:27,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9e9614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:27, skipping insertion in model container [2019-11-28 02:46:27,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:46:27" (2/3) ... [2019-11-28 02:46:27,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9e9614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:46:27, skipping insertion in model container [2019-11-28 02:46:27,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:46:27" (3/3) ... [2019-11-28 02:46:27,463 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-11-28 02:46:27,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:46:27,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 02:46:27,498 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 02:46:27,520 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:46:27,520 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:46:27,520 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:46:27,520 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:46:27,521 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:46:27,521 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:46:27,521 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:46:27,521 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:46:27,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-28 02:46:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:27,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,549 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:27,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-11-28 02:46:27,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881727182] [2019-11-28 02:46:27,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,735 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,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881727182] [2019-11-28 02:46:27,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419405591] [2019-11-28 02:46:27,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,769 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-28 02:46:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,824 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-11-28 02:46:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,838 INFO L225 Difference]: With dead ends: 68 [2019-11-28 02:46:27,838 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:46:27,840 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,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:46:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-11-28 02:46:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:46:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-11-28 02:46:27,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-11-28 02:46:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,882 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-11-28 02:46:27,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-11-28 02:46:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:46:27,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:27,884 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:27,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:27,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-11-28 02:46:27,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:27,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666436715] [2019-11-28 02:46:27,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:27,945 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,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666436715] [2019-11-28 02:46:27,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:27,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:27,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956367683] [2019-11-28 02:46:27,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:27,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:27,950 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-11-28 02:46:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:27,985 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2019-11-28 02:46:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:27,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 02:46:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:27,987 INFO L225 Difference]: With dead ends: 60 [2019-11-28 02:46:27,988 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 02:46:27,989 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,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 02:46:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-28 02:46:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:46:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-11-28 02:46:27,998 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-11-28 02:46:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:27,999 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-11-28 02:46:27,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-11-28 02:46:28,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:28,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,001 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:28,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-11-28 02:46:28,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958480918] [2019-11-28 02:46:28,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,066 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,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958480918] [2019-11-28 02:46:28,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434415367] [2019-11-28 02:46:28,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,074 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-11-28 02:46:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,106 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2019-11-28 02:46:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,111 INFO L225 Difference]: With dead ends: 63 [2019-11-28 02:46:28,111 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 02:46:28,111 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,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 02:46:28,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-28 02:46:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 02:46:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-11-28 02:46:28,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-11-28 02:46:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,134 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-11-28 02:46:28,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-11-28 02:46:28,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:28,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,138 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:28,138 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,141 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-11-28 02:46:28,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689996025] [2019-11-28 02:46:28,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,218 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,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689996025] [2019-11-28 02:46:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109627497] [2019-11-28 02:46:28,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,222 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-11-28 02:46:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,244 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2019-11-28 02:46:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,248 INFO L225 Difference]: With dead ends: 110 [2019-11-28 02:46:28,248 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 02:46:28,248 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,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 02:46:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-11-28 02:46:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 02:46:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-11-28 02:46:28,262 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-11-28 02:46:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,262 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-11-28 02:46:28,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-11-28 02:46:28,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 02:46:28,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,264 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:28,264 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-11-28 02:46:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986935942] [2019-11-28 02:46:28,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,327 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,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986935942] [2019-11-28 02:46:28,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759217474] [2019-11-28 02:46:28,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,329 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-11-28 02:46:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,362 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2019-11-28 02:46:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 02:46:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,365 INFO L225 Difference]: With dead ends: 112 [2019-11-28 02:46:28,365 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 02:46:28,365 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,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 02:46:28,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-28 02:46:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 02:46:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-11-28 02:46:28,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-11-28 02:46:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,377 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-11-28 02:46:28,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-11-28 02:46:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:28,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,380 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:28,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-11-28 02:46:28,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127254493] [2019-11-28 02:46:28,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,440 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,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127254493] [2019-11-28 02:46:28,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716637594] [2019-11-28 02:46:28,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,443 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-11-28 02:46:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,474 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 02:46:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,477 INFO L225 Difference]: With dead ends: 114 [2019-11-28 02:46:28,477 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 02:46:28,478 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,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 02:46:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-11-28 02:46:28,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 02:46:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-11-28 02:46:28,494 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-11-28 02:46:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,494 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-11-28 02:46:28,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-11-28 02:46:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:28,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,497 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:28,498 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-11-28 02:46:28,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483209198] [2019-11-28 02:46:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,551 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,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483209198] [2019-11-28 02:46:28,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421147509] [2019-11-28 02:46:28,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,559 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-11-28 02:46:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,584 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-11-28 02:46:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,586 INFO L225 Difference]: With dead ends: 202 [2019-11-28 02:46:28,586 INFO L226 Difference]: Without dead ends: 202 [2019-11-28 02:46:28,586 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,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-28 02:46:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-11-28 02:46:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 02:46:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-11-28 02:46:28,602 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-11-28 02:46:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,603 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-11-28 02:46:28,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-11-28 02:46:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 02:46:28,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,604 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:28,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-11-28 02:46:28,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83065771] [2019-11-28 02:46:28,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,635 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,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83065771] [2019-11-28 02:46:28,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862684222] [2019-11-28 02:46:28,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,638 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-11-28 02:46:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,661 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2019-11-28 02:46:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 02:46:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,664 INFO L225 Difference]: With dead ends: 210 [2019-11-28 02:46:28,664 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 02:46:28,665 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,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 02:46:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-11-28 02:46:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 02:46:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-11-28 02:46:28,676 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-11-28 02:46:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,677 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-11-28 02:46:28,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-11-28 02:46:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:28,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,679 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:28,680 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,680 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-11-28 02:46:28,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985042237] [2019-11-28 02:46:28,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,709 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,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985042237] [2019-11-28 02:46:28,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010973420] [2019-11-28 02:46:28,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,713 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-11-28 02:46:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,729 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2019-11-28 02:46:28,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,731 INFO L225 Difference]: With dead ends: 214 [2019-11-28 02:46:28,732 INFO L226 Difference]: Without dead ends: 214 [2019-11-28 02:46:28,732 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,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-28 02:46:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-11-28 02:46:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-28 02:46:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-11-28 02:46:28,742 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-11-28 02:46:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,742 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-11-28 02:46:28,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-11-28 02:46:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:28,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,753 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:28,753 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,754 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-11-28 02:46:28,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076002909] [2019-11-28 02:46:28,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,817 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,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076002909] [2019-11-28 02:46:28,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461963700] [2019-11-28 02:46:28,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,819 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-11-28 02:46:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,845 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2019-11-28 02:46:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,852 INFO L225 Difference]: With dead ends: 378 [2019-11-28 02:46:28,852 INFO L226 Difference]: Without dead ends: 378 [2019-11-28 02:46:28,854 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,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-28 02:46:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-11-28 02:46:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-28 02:46:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-11-28 02:46:28,866 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-11-28 02:46:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,866 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-11-28 02:46:28,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-11-28 02:46:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 02:46:28,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,868 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:28,868 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-11-28 02:46:28,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566772514] [2019-11-28 02:46:28,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,909 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,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566772514] [2019-11-28 02:46:28,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612979608] [2019-11-28 02:46:28,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,913 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-11-28 02:46:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,931 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2019-11-28 02:46:28,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 02:46:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,935 INFO L225 Difference]: With dead ends: 402 [2019-11-28 02:46:28,935 INFO L226 Difference]: Without dead ends: 402 [2019-11-28 02:46:28,935 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,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-28 02:46:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-11-28 02:46:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-11-28 02:46:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-11-28 02:46:28,949 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-11-28 02:46:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:28,950 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-11-28 02:46:28,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-11-28 02:46:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:28,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:28,952 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:28,952 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-11-28 02:46:28,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:28,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246363691] [2019-11-28 02:46:28,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:28,975 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,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246363691] [2019-11-28 02:46:28,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:28,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:28,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491545353] [2019-11-28 02:46:28,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:28,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:28,977 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-11-28 02:46:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:28,996 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2019-11-28 02:46:28,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:28,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:28,999 INFO L225 Difference]: With dead ends: 410 [2019-11-28 02:46:29,000 INFO L226 Difference]: Without dead ends: 410 [2019-11-28 02:46:29,000 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:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-28 02:46:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-11-28 02:46:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-28 02:46:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-11-28 02:46:29,012 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-11-28 02:46:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,013 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-11-28 02:46:29,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-11-28 02:46:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:29,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,014 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:29,015 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-11-28 02:46:29,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418498764] [2019-11-28 02:46:29,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,038 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:29,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418498764] [2019-11-28 02:46:29,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080040997] [2019-11-28 02:46:29,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,040 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-11-28 02:46:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,061 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2019-11-28 02:46:29,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,066 INFO L225 Difference]: With dead ends: 714 [2019-11-28 02:46:29,067 INFO L226 Difference]: Without dead ends: 714 [2019-11-28 02:46:29,067 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:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-28 02:46:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-11-28 02:46:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-28 02:46:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-11-28 02:46:29,087 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-11-28 02:46:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,087 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-11-28 02:46:29,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-11-28 02:46:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:46:29,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,090 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:29,090 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-11-28 02:46:29,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370031605] [2019-11-28 02:46:29,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,111 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:29,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370031605] [2019-11-28 02:46:29,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094969709] [2019-11-28 02:46:29,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,114 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-11-28 02:46:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,133 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2019-11-28 02:46:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 02:46:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,138 INFO L225 Difference]: With dead ends: 778 [2019-11-28 02:46:29,138 INFO L226 Difference]: Without dead ends: 778 [2019-11-28 02:46:29,138 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:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-28 02:46:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-11-28 02:46:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-28 02:46:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-11-28 02:46:29,161 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-11-28 02:46:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,161 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-11-28 02:46:29,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-11-28 02:46:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:29,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,163 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:29,164 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-11-28 02:46:29,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730570271] [2019-11-28 02:46:29,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,186 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:29,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730570271] [2019-11-28 02:46:29,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27846383] [2019-11-28 02:46:29,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,189 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-11-28 02:46:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,205 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2019-11-28 02:46:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,210 INFO L225 Difference]: With dead ends: 794 [2019-11-28 02:46:29,211 INFO L226 Difference]: Without dead ends: 794 [2019-11-28 02:46:29,211 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:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-11-28 02:46:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-11-28 02:46:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-11-28 02:46:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-11-28 02:46:29,233 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-11-28 02:46:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-11-28 02:46:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-11-28 02:46:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:29,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,236 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:29,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-11-28 02:46:29,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137429130] [2019-11-28 02:46:29,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,264 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:29,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137429130] [2019-11-28 02:46:29,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470609762] [2019-11-28 02:46:29,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,266 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-11-28 02:46:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,291 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2019-11-28 02:46:29,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,298 INFO L225 Difference]: With dead ends: 1354 [2019-11-28 02:46:29,299 INFO L226 Difference]: Without dead ends: 1354 [2019-11-28 02:46:29,299 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:29,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-28 02:46:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-11-28 02:46:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-11-28 02:46:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-11-28 02:46:29,333 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-11-28 02:46:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,334 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-11-28 02:46:29,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-11-28 02:46:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:46:29,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,337 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:29,337 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-11-28 02:46:29,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247637194] [2019-11-28 02:46:29,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,365 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:29,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247637194] [2019-11-28 02:46:29,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194531991] [2019-11-28 02:46:29,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,372 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-11-28 02:46:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,396 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2019-11-28 02:46:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 02:46:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,404 INFO L225 Difference]: With dead ends: 1514 [2019-11-28 02:46:29,405 INFO L226 Difference]: Without dead ends: 1514 [2019-11-28 02:46:29,406 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:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-11-28 02:46:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-11-28 02:46:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-11-28 02:46:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-11-28 02:46:29,445 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-11-28 02:46:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,447 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-11-28 02:46:29,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-11-28 02:46:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:29,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,451 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, 1] [2019-11-28 02:46:29,452 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-11-28 02:46:29,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023344359] [2019-11-28 02:46:29,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,474 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:29,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023344359] [2019-11-28 02:46:29,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077995946] [2019-11-28 02:46:29,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,482 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-11-28 02:46:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,505 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2019-11-28 02:46:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,513 INFO L225 Difference]: With dead ends: 1546 [2019-11-28 02:46:29,514 INFO L226 Difference]: Without dead ends: 1546 [2019-11-28 02:46:29,514 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:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-11-28 02:46:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-11-28 02:46:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-28 02:46:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-11-28 02:46:29,567 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-11-28 02:46:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,568 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-11-28 02:46:29,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-11-28 02:46:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:29,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,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, 1, 1, 1] [2019-11-28 02:46:29,575 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-11-28 02:46:29,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212470708] [2019-11-28 02:46:29,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,612 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:29,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212470708] [2019-11-28 02:46:29,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693827842] [2019-11-28 02:46:29,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,617 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-11-28 02:46:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,656 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2019-11-28 02:46:29,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,673 INFO L225 Difference]: With dead ends: 2570 [2019-11-28 02:46:29,674 INFO L226 Difference]: Without dead ends: 2570 [2019-11-28 02:46:29,675 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:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-11-28 02:46:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-11-28 02:46:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-28 02:46:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-11-28 02:46:29,752 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-11-28 02:46:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,752 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-11-28 02:46:29,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-11-28 02:46:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:46:29,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,759 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, 1] [2019-11-28 02:46:29,760 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-11-28 02:46:29,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302666537] [2019-11-28 02:46:29,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,796 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:29,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302666537] [2019-11-28 02:46:29,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319821805] [2019-11-28 02:46:29,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,799 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-11-28 02:46:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:29,839 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2019-11-28 02:46:29,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:29,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 02:46:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:29,855 INFO L225 Difference]: With dead ends: 2954 [2019-11-28 02:46:29,855 INFO L226 Difference]: Without dead ends: 2954 [2019-11-28 02:46:29,856 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:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-11-28 02:46:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-11-28 02:46:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-11-28 02:46:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-11-28 02:46:29,951 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-11-28 02:46:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:29,952 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-11-28 02:46:29,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:29,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-11-28 02:46:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:29,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:29,958 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, 1, 1] [2019-11-28 02:46:29,958 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-11-28 02:46:29,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:29,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081244974] [2019-11-28 02:46:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:29,983 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:29,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081244974] [2019-11-28 02:46:29,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:29,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:29,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060174250] [2019-11-28 02:46:29,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:29,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:29,987 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-11-28 02:46:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,028 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2019-11-28 02:46:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,043 INFO L225 Difference]: With dead ends: 3018 [2019-11-28 02:46:30,044 INFO L226 Difference]: Without dead ends: 3018 [2019-11-28 02:46:30,045 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:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-11-28 02:46:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-11-28 02:46:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-11-28 02:46:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-11-28 02:46:30,151 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-11-28 02:46:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,152 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-11-28 02:46:30,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-11-28 02:46:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:30,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,157 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, 1, 1] [2019-11-28 02:46:30,157 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-11-28 02:46:30,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-28 02:46:30,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,193 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:30,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622520127] [2019-11-28 02:46:30,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926245178] [2019-11-28 02:46:30,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,197 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-11-28 02:46:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,234 INFO L93 Difference]: Finished difference Result 5768 states and 6278 transitions. [2019-11-28 02:46:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,248 INFO L225 Difference]: With dead ends: 5768 [2019-11-28 02:46:30,249 INFO L226 Difference]: Without dead ends: 3016 [2019-11-28 02:46:30,249 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:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-11-28 02:46:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-11-28 02:46:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-11-28 02:46:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-11-28 02:46:30,311 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-11-28 02:46:30,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,312 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-11-28 02:46:30,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-11-28 02:46:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 02:46:30,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:46:30,317 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, 1, 1] [2019-11-28 02:46:30,317 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK]=== [2019-11-28 02:46:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:46:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-11-28 02:46:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:46:30,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391266778] [2019-11-28 02:46:30,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:46:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:46:30,347 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:30,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391266778] [2019-11-28 02:46:30,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:46:30,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:46:30,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125354794] [2019-11-28 02:46:30,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 02:46:30,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:46:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:46:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:46:30,349 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-11-28 02:46:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:46:30,366 INFO L93 Difference]: Finished difference Result 3014 states and 3141 transitions. [2019-11-28 02:46:30,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:46:30,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 02:46:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:46:30,367 INFO L225 Difference]: With dead ends: 3014 [2019-11-28 02:46:30,368 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:46:30,368 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:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:46:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:46:30,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:46:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:46:30,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-28 02:46:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:46:30,370 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:46:30,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 02:46:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:46:30,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:46:30,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:46:30 BoogieIcfgContainer [2019-11-28 02:46:30,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:46:30,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:46:30,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:46:30,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:46:30,380 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:27" (3/4) ... [2019-11-28 02:46:30,384 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:46:30,393 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:46:30,393 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:46:30,402 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 02:46:30,402 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 02:46:30,403 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:46:30,511 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:46:30,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:46:30,514 INFO L168 Benchmark]: Toolchain (without parser) took 3852.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -194.8 MB). Peak memory consumption was 42.2 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:30,515 INFO L168 Benchmark]: CDTParser took 1.45 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:30,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:30,516 INFO L168 Benchmark]: Boogie Preprocessor took 39.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:30,516 INFO L168 Benchmark]: RCFGBuilder took 388.90 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.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:30,517 INFO L168 Benchmark]: TraceAbstraction took 2921.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:46:30,517 INFO L168 Benchmark]: Witness Printer took 133.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:46:30,520 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.45 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 362.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.83 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 388.90 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.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2921.92 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Witness Printer took 133.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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, 38 locations, 1 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...