./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd6d122756047ddb1225c106ac06a6748e14c22 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:50:45,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:50:45,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:50:45,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:50:45,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:50:45,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:50:45,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:50:45,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:50:45,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:50:45,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:50:45,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:50:45,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:50:45,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:50:45,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:50:45,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:50:45,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:50:45,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:50:45,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:50:45,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:50:45,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:50:45,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:50:45,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:50:45,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:50:45,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:50:45,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:50:45,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:50:45,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:50:45,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:50:45,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:50:45,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:50:45,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:50:45,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:50:45,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:50:45,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:50:45,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:50:45,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:50:45,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:50:45,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:50:45,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:50:45,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:50:45,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:50:45,847 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:50:45,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:50:45,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:50:45,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:50:45,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:50:45,878 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:50:45,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:50:45,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:50:45,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:50:45,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:50:45,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:50:45,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:50:45,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:50:45,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:50:45,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:50:45,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:50:45,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:50:45,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:50:45,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:50:45,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:50:45,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:50:45,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:50:45,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:50:45,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:50:45,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:50:45,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:50:45,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:50:45,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:50:45,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:50:45,883 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-11-20 00:50:46,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:50:46,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:50:46,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:50:46,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:50:46,073 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:50:46,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_7.c [2019-11-20 00:50:46,145 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/data/9ab1215c1/e89750fb082f4da0a49544c7e2a3cd49/FLAG4776d82fb [2019-11-20 00:50:46,558 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:50:46,559 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/sv-benchmarks/c/locks/test_locks_7.c [2019-11-20 00:50:46,571 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/data/9ab1215c1/e89750fb082f4da0a49544c7e2a3cd49/FLAG4776d82fb [2019-11-20 00:50:46,964 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/data/9ab1215c1/e89750fb082f4da0a49544c7e2a3cd49 [2019-11-20 00:50:46,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:50:46,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:50:46,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:50:46,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:50:46,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:50:46,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:50:46" (1/1) ... [2019-11-20 00:50:46,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f9a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:46, skipping insertion in model container [2019-11-20 00:50:46,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:50:46" (1/1) ... [2019-11-20 00:50:46,994 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:50:47,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:50:47,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:50:47,199 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:50:47,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:50:47,331 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:50:47,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47 WrapperNode [2019-11-20 00:50:47,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:50:47,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:50:47,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:50:47,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:50:47,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:50:47,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:50:47,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:50:47,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:50:47,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... [2019-11-20 00:50:47,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:50:47,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:50:47,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:50:47,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:50:47,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/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-20 00:50:47,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:50:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:50:47,879 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:50:47,880 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 00:50:47,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:50:47 BoogieIcfgContainer [2019-11-20 00:50:47,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:50:47,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:50:47,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:50:47,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:50:47,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:50:46" (1/3) ... [2019-11-20 00:50:47,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7151898c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:50:47, skipping insertion in model container [2019-11-20 00:50:47,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:50:47" (2/3) ... [2019-11-20 00:50:47,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7151898c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:50:47, skipping insertion in model container [2019-11-20 00:50:47,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:50:47" (3/3) ... [2019-11-20 00:50:47,896 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-20 00:50:47,908 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:50:47,916 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:50:47,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:50:47,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:50:47,967 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:50:47,968 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:50:47,969 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:50:47,969 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:50:47,969 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:50:47,969 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:50:47,973 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:50:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-20 00:50:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:50:48,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,004 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-11-20 00:50:48,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554659614] [2019-11-20 00:50:48,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,285 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-20 00:50:48,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554659614] [2019-11-20 00:50:48,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969512252] [2019-11-20 00:50:48,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,315 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-20 00:50:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,366 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-11-20 00:50:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 00:50:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,378 INFO L225 Difference]: With dead ends: 64 [2019-11-20 00:50:48,378 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 00:50:48,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 00:50:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-11-20 00:50:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 00:50:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-11-20 00:50:48,430 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-11-20 00:50:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,431 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-11-20 00:50:48,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-11-20 00:50:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 00:50:48,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-11-20 00:50:48,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136829714] [2019-11-20 00:50:48,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,491 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-20 00:50:48,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136829714] [2019-11-20 00:50:48,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514020128] [2019-11-20 00:50:48,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,495 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-11-20 00:50:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,533 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-11-20 00:50:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 00:50:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,536 INFO L225 Difference]: With dead ends: 83 [2019-11-20 00:50:48,536 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 00:50:48,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 00:50:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-20 00:50:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 00:50:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-11-20 00:50:48,550 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-11-20 00:50:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,551 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-11-20 00:50:48,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-11-20 00:50:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:50:48,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,553 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-11-20 00:50:48,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048591662] [2019-11-20 00:50:48,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,616 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-20 00:50:48,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048591662] [2019-11-20 00:50:48,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134858815] [2019-11-20 00:50:48,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,619 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-11-20 00:50:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,642 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-11-20 00:50:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 00:50:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,644 INFO L225 Difference]: With dead ends: 77 [2019-11-20 00:50:48,645 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 00:50:48,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 00:50:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-20 00:50:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 00:50:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-11-20 00:50:48,654 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-11-20 00:50:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,655 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-11-20 00:50:48,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-11-20 00:50:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:50:48,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,657 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-11-20 00:50:48,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928062567] [2019-11-20 00:50:48,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,696 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-20 00:50:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928062567] [2019-11-20 00:50:48,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40767542] [2019-11-20 00:50:48,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,699 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-11-20 00:50:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,720 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-11-20 00:50:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 00:50:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,723 INFO L225 Difference]: With dead ends: 96 [2019-11-20 00:50:48,723 INFO L226 Difference]: Without dead ends: 94 [2019-11-20 00:50:48,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-20 00:50:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-11-20 00:50:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 00:50:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-11-20 00:50:48,734 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-11-20 00:50:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,735 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-11-20 00:50:48,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-11-20 00:50:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 00:50:48,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-11-20 00:50:48,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110481856] [2019-11-20 00:50:48,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,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-20 00:50:48,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110481856] [2019-11-20 00:50:48,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134131288] [2019-11-20 00:50:48,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,798 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-11-20 00:50:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,845 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-11-20 00:50:48,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 00:50:48,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,846 INFO L225 Difference]: With dead ends: 160 [2019-11-20 00:50:48,847 INFO L226 Difference]: Without dead ends: 96 [2019-11-20 00:50:48,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-20 00:50:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-20 00:50:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-20 00:50:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-11-20 00:50:48,862 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-11-20 00:50:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,863 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-11-20 00:50:48,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-11-20 00:50:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 00:50:48,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-11-20 00:50:48,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214059547] [2019-11-20 00:50:48,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,899 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-20 00:50:48,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214059547] [2019-11-20 00:50:48,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676165421] [2019-11-20 00:50:48,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,902 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-11-20 00:50:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:48,920 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-11-20 00:50:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:48,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 00:50:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:48,923 INFO L225 Difference]: With dead ends: 143 [2019-11-20 00:50:48,923 INFO L226 Difference]: Without dead ends: 98 [2019-11-20 00:50:48,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-20 00:50:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-20 00:50:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 00:50:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-11-20 00:50:48,935 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-11-20 00:50:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:48,935 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-11-20 00:50:48,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-11-20 00:50:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 00:50:48,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:48,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:48,937 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-11-20 00:50:48,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:48,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965591227] [2019-11-20 00:50:48,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:48,966 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-20 00:50:48,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965591227] [2019-11-20 00:50:48,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:48,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:48,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463423570] [2019-11-20 00:50:48,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:48,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:48,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:48,969 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-11-20 00:50:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,012 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-11-20 00:50:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 00:50:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,015 INFO L225 Difference]: With dead ends: 272 [2019-11-20 00:50:49,015 INFO L226 Difference]: Without dead ends: 182 [2019-11-20 00:50:49,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-20 00:50:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-20 00:50:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-20 00:50:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-11-20 00:50:49,034 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-11-20 00:50:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,034 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-11-20 00:50:49,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-11-20 00:50:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 00:50:49,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-11-20 00:50:49,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358352834] [2019-11-20 00:50:49,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,095 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-20 00:50:49,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358352834] [2019-11-20 00:50:49,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674636847] [2019-11-20 00:50:49,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,097 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-11-20 00:50:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,131 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-11-20 00:50:49,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 00:50:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,135 INFO L225 Difference]: With dead ends: 224 [2019-11-20 00:50:49,135 INFO L226 Difference]: Without dead ends: 222 [2019-11-20 00:50:49,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-20 00:50:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-11-20 00:50:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-20 00:50:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-11-20 00:50:49,173 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-11-20 00:50:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,174 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-11-20 00:50:49,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-11-20 00:50:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:50:49,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,177 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-11-20 00:50:49,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130681847] [2019-11-20 00:50:49,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,230 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-20 00:50:49,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130681847] [2019-11-20 00:50:49,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762344368] [2019-11-20 00:50:49,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,232 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-11-20 00:50:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,275 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-11-20 00:50:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 00:50:49,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,281 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:50:49,282 INFO L226 Difference]: Without dead ends: 322 [2019-11-20 00:50:49,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-20 00:50:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-11-20 00:50:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-20 00:50:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-11-20 00:50:49,314 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-11-20 00:50:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,314 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-11-20 00:50:49,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-11-20 00:50:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:50:49,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,318 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-11-20 00:50:49,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117397225] [2019-11-20 00:50:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,378 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-20 00:50:49,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117397225] [2019-11-20 00:50:49,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898233452] [2019-11-20 00:50:49,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,380 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-11-20 00:50:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,429 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-11-20 00:50:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 00:50:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,433 INFO L225 Difference]: With dead ends: 596 [2019-11-20 00:50:49,433 INFO L226 Difference]: Without dead ends: 346 [2019-11-20 00:50:49,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-20 00:50:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-11-20 00:50:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-20 00:50:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-11-20 00:50:49,452 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-11-20 00:50:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,453 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-11-20 00:50:49,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-11-20 00:50:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:50:49,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,455 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,456 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-11-20 00:50:49,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253590807] [2019-11-20 00:50:49,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,526 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-20 00:50:49,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253590807] [2019-11-20 00:50:49,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131955243] [2019-11-20 00:50:49,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,528 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-11-20 00:50:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,611 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-11-20 00:50:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 00:50:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,614 INFO L225 Difference]: With dead ends: 524 [2019-11-20 00:50:49,614 INFO L226 Difference]: Without dead ends: 358 [2019-11-20 00:50:49,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-20 00:50:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-20 00:50:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 00:50:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-11-20 00:50:49,642 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-11-20 00:50:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,643 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-11-20 00:50:49,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-11-20 00:50:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:50:49,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,645 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-11-20 00:50:49,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415821] [2019-11-20 00:50:49,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,731 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-20 00:50:49,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415821] [2019-11-20 00:50:49,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372485388] [2019-11-20 00:50:49,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,733 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-11-20 00:50:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,759 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-11-20 00:50:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 00:50:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,764 INFO L225 Difference]: With dead ends: 616 [2019-11-20 00:50:49,764 INFO L226 Difference]: Without dead ends: 614 [2019-11-20 00:50:49,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-20 00:50:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-11-20 00:50:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-20 00:50:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-11-20 00:50:49,792 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-11-20 00:50:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,792 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-11-20 00:50:49,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-11-20 00:50:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 00:50:49,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:50:49,795 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-11-20 00:50:49,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909958947] [2019-11-20 00:50:49,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,850 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-20 00:50:49,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909958947] [2019-11-20 00:50:49,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772905689] [2019-11-20 00:50:49,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,852 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-11-20 00:50:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,880 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-11-20 00:50:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 00:50:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,886 INFO L225 Difference]: With dead ends: 1176 [2019-11-20 00:50:49,886 INFO L226 Difference]: Without dead ends: 678 [2019-11-20 00:50:49,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-11-20 00:50:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-11-20 00:50:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-20 00:50:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-11-20 00:50:49,913 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-11-20 00:50:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:49,913 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-11-20 00:50:49,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-11-20 00:50:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:50:49,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:49,915 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-20 00:50:49,915 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-11-20 00:50:49,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:49,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261492406] [2019-11-20 00:50:49,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:49,935 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-20 00:50:49,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261492406] [2019-11-20 00:50:49,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:49,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:49,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240972635] [2019-11-20 00:50:49,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:49,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,937 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-11-20 00:50:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:49,969 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-11-20 00:50:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:49,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 00:50:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:49,975 INFO L225 Difference]: With dead ends: 1016 [2019-11-20 00:50:49,975 INFO L226 Difference]: Without dead ends: 694 [2019-11-20 00:50:49,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-20 00:50:50,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-20 00:50:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-20 00:50:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-11-20 00:50:50,004 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-11-20 00:50:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,006 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-11-20 00:50:50,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-11-20 00:50:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:50:50,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:50,008 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-20 00:50:50,009 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:50,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-11-20 00:50:50,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:50,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532727582] [2019-11-20 00:50:50,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:50,047 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-20 00:50:50,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532727582] [2019-11-20 00:50:50,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:50,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:50,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259081499] [2019-11-20 00:50:50,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:50,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,050 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-11-20 00:50:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:50,093 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-11-20 00:50:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:50,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 00:50:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:50,101 INFO L225 Difference]: With dead ends: 1160 [2019-11-20 00:50:50,101 INFO L226 Difference]: Without dead ends: 1158 [2019-11-20 00:50:50,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-20 00:50:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-11-20 00:50:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-20 00:50:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-11-20 00:50:50,153 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-11-20 00:50:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,154 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-11-20 00:50:50,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-11-20 00:50:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:50:50,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:50,159 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-20 00:50:50,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-11-20 00:50:50,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:50,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023687440] [2019-11-20 00:50:50,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:50,198 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-20 00:50:50,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023687440] [2019-11-20 00:50:50,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:50,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:50,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834987294] [2019-11-20 00:50:50,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:50,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:50,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,200 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-11-20 00:50:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:50,249 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-11-20 00:50:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:50,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 00:50:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:50,258 INFO L225 Difference]: With dead ends: 2312 [2019-11-20 00:50:50,258 INFO L226 Difference]: Without dead ends: 1318 [2019-11-20 00:50:50,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-20 00:50:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-11-20 00:50:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-11-20 00:50:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-11-20 00:50:50,318 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-11-20 00:50:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,318 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-11-20 00:50:50,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-11-20 00:50:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:50:50,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:50,324 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-20 00:50:50,324 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:50,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-11-20 00:50:50,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:50,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295013727] [2019-11-20 00:50:50,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:50,359 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-20 00:50:50,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295013727] [2019-11-20 00:50:50,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:50,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:50,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089381245] [2019-11-20 00:50:50,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:50,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,362 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-11-20 00:50:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:50,405 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-11-20 00:50:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:50,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:50:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:50,414 INFO L225 Difference]: With dead ends: 1976 [2019-11-20 00:50:50,415 INFO L226 Difference]: Without dead ends: 1350 [2019-11-20 00:50:50,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-20 00:50:50,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-20 00:50:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-20 00:50:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-11-20 00:50:50,476 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-11-20 00:50:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,476 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-11-20 00:50:50,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-11-20 00:50:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:50:50,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:50,479 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-20 00:50:50,479 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-11-20 00:50:50,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:50,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951613601] [2019-11-20 00:50:50,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:50,509 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-20 00:50:50,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951613601] [2019-11-20 00:50:50,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:50,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:50,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567694766] [2019-11-20 00:50:50,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:50,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,511 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-11-20 00:50:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:50,573 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-11-20 00:50:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:50,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:50:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:50,612 INFO L225 Difference]: With dead ends: 2182 [2019-11-20 00:50:50,612 INFO L226 Difference]: Without dead ends: 2180 [2019-11-20 00:50:50,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-11-20 00:50:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-11-20 00:50:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-20 00:50:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-11-20 00:50:50,686 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-11-20 00:50:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,686 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-11-20 00:50:50,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-11-20 00:50:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:50:50,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:50,690 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-20 00:50:50,690 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-11-20 00:50:50,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:50:50,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586971168] [2019-11-20 00:50:50,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:50:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:50,713 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-20 00:50:50,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586971168] [2019-11-20 00:50:50,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:50:50,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:50:50,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125483235] [2019-11-20 00:50:50,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:50:50,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:50:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:50:50,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,715 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-11-20 00:50:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:50,787 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-11-20 00:50:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:50:50,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:50:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:50,788 INFO L225 Difference]: With dead ends: 4548 [2019-11-20 00:50:50,788 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:50:50,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:50:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:50:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:50:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:50:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:50:50,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-20 00:50:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:50,795 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:50:50,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:50:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:50:50,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:50:50,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:50:50,817 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 00:50:50,817 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L447 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-20 00:50:50,818 INFO L447 ceAbstractionStarter]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L440 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,818 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-20 00:50:50,819 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,821 INFO L447 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-20 00:50:50,821 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-20 00:50:50,822 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,822 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-20 00:50:50,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:50:50 BoogieIcfgContainer [2019-11-20 00:50:50,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:50:50,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:50:50,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:50:50,832 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:50:50,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:50:47" (3/4) ... [2019-11-20 00:50:50,836 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:50:50,852 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:50:50,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:50:50,951 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8b42e1fa-84f2-4b77-b0cf-988f4b9016dd/bin/uautomizer/witness.graphml [2019-11-20 00:50:50,952 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:50:50,954 INFO L168 Benchmark]: Toolchain (without parser) took 3984.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -127.4 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:50:50,955 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:50:50,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:50:50,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:50:50,956 INFO L168 Benchmark]: Boogie Preprocessor took 44.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:50:50,956 INFO L168 Benchmark]: RCFGBuilder took 460.05 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:50:50,957 INFO L168 Benchmark]: TraceAbstraction took 2948.50 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:50:50,957 INFO L168 Benchmark]: Witness Printer took 120.29 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:50:50,960 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.05 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2948.50 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Witness Printer took 120.29 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...