./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5.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_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:20:59,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:20:59,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:20:59,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:20:59,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:20:59,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:20:59,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:20:59,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:20:59,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:20:59,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:20:59,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:20:59,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:20:59,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:20:59,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:20:59,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:20:59,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:20:59,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:20:59,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:20:59,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:20:59,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:20:59,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:20:59,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:20:59,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:20:59,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:20:59,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:20:59,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:20:59,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:20:59,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:20:59,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:20:59,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:20:59,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:20:59,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:20:59,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:20:59,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:20:59,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:20:59,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:20:59,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:20:59,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:20:59,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:20:59,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:20:59,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:20:59,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:20:59,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:20:59,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:20:59,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:20:59,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:20:59,471 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:20:59,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:20:59,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:20:59,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:20:59,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:20:59,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:20:59,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:20:59,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:20:59,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:20:59,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:20:59,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:20:59,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:20:59,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:20:59,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:20:59,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:20:59,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:20:59,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:20:59,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:20:59,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:20:59,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:20:59,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:20:59,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:20:59,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:20:59,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:20:59,476 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_a8d2f810-eb99-44a1-ab44-834207ff8cda/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2019-11-20 03:20:59,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:20:59,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:20:59,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:20:59,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:20:59,703 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:20:59,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_5.c [2019-11-20 03:20:59,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/data/a3b6af6eb/375e42edd89e4032a51a0ccce6bc41e7/FLAG2d0500f49 [2019-11-20 03:21:00,137 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:21:00,138 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/sv-benchmarks/c/locks/test_locks_5.c [2019-11-20 03:21:00,144 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/data/a3b6af6eb/375e42edd89e4032a51a0ccce6bc41e7/FLAG2d0500f49 [2019-11-20 03:21:00,531 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/data/a3b6af6eb/375e42edd89e4032a51a0ccce6bc41e7 [2019-11-20 03:21:00,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:21:00,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:21:00,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:21:00,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:21:00,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:21:00,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:00,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6d70f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00, skipping insertion in model container [2019-11-20 03:21:00,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:00,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:21:00,584 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:21:00,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:21:00,817 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:21:00,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:21:00,941 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:21:00,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00 WrapperNode [2019-11-20 03:21:00,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:21:00,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:21:00,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:21:00,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:21:00,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:00,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:00,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:21:00,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:21:00,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:21:00,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:21:01,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... [2019-11-20 03:21:01,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:21:01,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:21:01,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:21:01,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:21:01,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/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 03:21:01,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:21:01,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:21:01,427 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:21:01,427 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 03:21:01,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:21:01 BoogieIcfgContainer [2019-11-20 03:21:01,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:21:01,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:21:01,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:21:01,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:21:01,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:21:00" (1/3) ... [2019-11-20 03:21:01,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a963c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:21:01, skipping insertion in model container [2019-11-20 03:21:01,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:21:00" (2/3) ... [2019-11-20 03:21:01,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a963c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:21:01, skipping insertion in model container [2019-11-20 03:21:01,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:21:01" (3/3) ... [2019-11-20 03:21:01,437 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2019-11-20 03:21:01,447 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:21:01,461 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:21:01,478 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:21:01,502 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:21:01,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:21:01,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:21:01,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:21:01,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:21:01,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:21:01,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:21:01,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:21:01,547 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-20 03:21:01,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:21:01,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:01,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:01,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1401695884, now seen corresponding path program 1 times [2019-11-20 03:21:01,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:01,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674563120] [2019-11-20 03:21:01,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:01,738 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 03:21:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674563120] [2019-11-20 03:21:01,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:01,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744568513] [2019-11-20 03:21:01,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:01,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:01,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:01,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:01,760 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-20 03:21:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:01,810 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2019-11-20 03:21:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:01,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 03:21:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:01,822 INFO L225 Difference]: With dead ends: 52 [2019-11-20 03:21:01,823 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 03:21:01,826 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 03:21:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 03:21:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2019-11-20 03:21:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 03:21:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2019-11-20 03:21:01,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2019-11-20 03:21:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:01,862 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2019-11-20 03:21:01,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2019-11-20 03:21:01,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:21:01,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:01,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:01,864 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:01,864 INFO L82 PathProgramCache]: Analyzing trace with hash 592349258, now seen corresponding path program 1 times [2019-11-20 03:21:01,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:01,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903927991] [2019-11-20 03:21:01,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:01,912 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 03:21:01,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903927991] [2019-11-20 03:21:01,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:01,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:01,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650519600] [2019-11-20 03:21:01,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:01,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:01,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:01,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:01,916 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 3 states. [2019-11-20 03:21:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:01,937 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2019-11-20 03:21:01,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:01,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-20 03:21:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:01,939 INFO L225 Difference]: With dead ends: 63 [2019-11-20 03:21:01,939 INFO L226 Difference]: Without dead ends: 38 [2019-11-20 03:21:01,941 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 03:21:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-20 03:21:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-20 03:21:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 03:21:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2019-11-20 03:21:01,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2019-11-20 03:21:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:01,952 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2019-11-20 03:21:01,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2019-11-20 03:21:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:21:01,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:01,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:01,955 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 503114411, now seen corresponding path program 1 times [2019-11-20 03:21:01,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:01,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065505573] [2019-11-20 03:21:01,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:01,998 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 03:21:01,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065505573] [2019-11-20 03:21:01,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:01,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:01,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294915943] [2019-11-20 03:21:02,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,001 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand 3 states. [2019-11-20 03:21:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,023 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2019-11-20 03:21:02,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 03:21:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,025 INFO L225 Difference]: With dead ends: 59 [2019-11-20 03:21:02,025 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 03:21:02,028 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 03:21:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 03:21:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-20 03:21:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 03:21:02,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-11-20 03:21:02,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2019-11-20 03:21:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,046 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-11-20 03:21:02,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,046 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-11-20 03:21:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:21:02,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,056 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,056 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1183172781, now seen corresponding path program 1 times [2019-11-20 03:21:02,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869776061] [2019-11-20 03:21:02,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,092 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 03:21:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869776061] [2019-11-20 03:21:02,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248125327] [2019-11-20 03:21:02,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,094 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2019-11-20 03:21:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,125 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2019-11-20 03:21:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 03:21:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,127 INFO L225 Difference]: With dead ends: 72 [2019-11-20 03:21:02,127 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 03:21:02,128 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 03:21:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 03:21:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-20 03:21:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 03:21:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2019-11-20 03:21:02,135 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2019-11-20 03:21:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,136 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2019-11-20 03:21:02,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2019-11-20 03:21:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 03:21:02,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 373826155, now seen corresponding path program 1 times [2019-11-20 03:21:02,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005378331] [2019-11-20 03:21:02,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,165 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 03:21:02,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005378331] [2019-11-20 03:21:02,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367481950] [2019-11-20 03:21:02,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,167 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand 3 states. [2019-11-20 03:21:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,192 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2019-11-20 03:21:02,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-20 03:21:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,197 INFO L225 Difference]: With dead ends: 120 [2019-11-20 03:21:02,197 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 03:21:02,197 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 03:21:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 03:21:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-20 03:21:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 03:21:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2019-11-20 03:21:02,211 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2019-11-20 03:21:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,212 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2019-11-20 03:21:02,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2019-11-20 03:21:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:21:02,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1976134145, now seen corresponding path program 1 times [2019-11-20 03:21:02,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521213450] [2019-11-20 03:21:02,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,238 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 03:21:02,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521213450] [2019-11-20 03:21:02,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562564941] [2019-11-20 03:21:02,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,240 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 3 states. [2019-11-20 03:21:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,255 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2019-11-20 03:21:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 03:21:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,257 INFO L225 Difference]: With dead ends: 107 [2019-11-20 03:21:02,257 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 03:21:02,258 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 03:21:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 03:21:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-11-20 03:21:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 03:21:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2019-11-20 03:21:02,266 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2019-11-20 03:21:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,267 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2019-11-20 03:21:02,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2019-11-20 03:21:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:21:02,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,268 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1296075775, now seen corresponding path program 1 times [2019-11-20 03:21:02,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268175312] [2019-11-20 03:21:02,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,294 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 03:21:02,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268175312] [2019-11-20 03:21:02,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917345547] [2019-11-20 03:21:02,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,296 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand 3 states. [2019-11-20 03:21:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,328 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2019-11-20 03:21:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 03:21:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,331 INFO L225 Difference]: With dead ends: 200 [2019-11-20 03:21:02,331 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 03:21:02,332 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 03:21:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 03:21:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-11-20 03:21:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 03:21:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2019-11-20 03:21:02,348 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2019-11-20 03:21:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,348 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2019-11-20 03:21:02,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2019-11-20 03:21:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 03:21:02,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash -486729149, now seen corresponding path program 1 times [2019-11-20 03:21:02,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399812347] [2019-11-20 03:21:02,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,377 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 03:21:02,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399812347] [2019-11-20 03:21:02,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57997620] [2019-11-20 03:21:02,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,380 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand 3 states. [2019-11-20 03:21:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,397 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2019-11-20 03:21:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-20 03:21:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,399 INFO L225 Difference]: With dead ends: 160 [2019-11-20 03:21:02,399 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 03:21:02,400 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 03:21:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 03:21:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2019-11-20 03:21:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 03:21:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2019-11-20 03:21:02,416 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2019-11-20 03:21:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,416 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2019-11-20 03:21:02,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2019-11-20 03:21:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:21:02,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1523427712, now seen corresponding path program 1 times [2019-11-20 03:21:02,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102857263] [2019-11-20 03:21:02,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,460 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 03:21:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102857263] [2019-11-20 03:21:02,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014898343] [2019-11-20 03:21:02,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,463 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand 3 states. [2019-11-20 03:21:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,484 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2019-11-20 03:21:02,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 03:21:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,487 INFO L225 Difference]: With dead ends: 228 [2019-11-20 03:21:02,487 INFO L226 Difference]: Without dead ends: 226 [2019-11-20 03:21:02,488 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 03:21:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-20 03:21:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2019-11-20 03:21:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-20 03:21:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-20 03:21:02,513 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2019-11-20 03:21:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,513 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-20 03:21:02,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-20 03:21:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 03:21:02,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,522 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1962192958, now seen corresponding path program 1 times [2019-11-20 03:21:02,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100499829] [2019-11-20 03:21:02,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,546 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 03:21:02,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100499829] [2019-11-20 03:21:02,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906630310] [2019-11-20 03:21:02,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,549 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 3 states. [2019-11-20 03:21:02,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,603 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2019-11-20 03:21:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-20 03:21:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,606 INFO L225 Difference]: With dead ends: 436 [2019-11-20 03:21:02,606 INFO L226 Difference]: Without dead ends: 250 [2019-11-20 03:21:02,608 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 03:21:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-11-20 03:21:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-11-20 03:21:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-20 03:21:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2019-11-20 03:21:02,631 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2019-11-20 03:21:02,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,631 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2019-11-20 03:21:02,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2019-11-20 03:21:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:21:02,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,634 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 18597174, now seen corresponding path program 1 times [2019-11-20 03:21:02,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316868388] [2019-11-20 03:21:02,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:21:02,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316868388] [2019-11-20 03:21:02,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217976918] [2019-11-20 03:21:02,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,660 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand 3 states. [2019-11-20 03:21:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,683 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2019-11-20 03:21:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 03:21:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,686 INFO L225 Difference]: With dead ends: 380 [2019-11-20 03:21:02,686 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 03:21:02,687 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 03:21:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 03:21:02,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-11-20 03:21:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-20 03:21:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2019-11-20 03:21:02,704 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2019-11-20 03:21:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,705 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2019-11-20 03:21:02,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2019-11-20 03:21:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:21:02,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,707 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash 698655544, now seen corresponding path program 1 times [2019-11-20 03:21:02,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026569018] [2019-11-20 03:21:02,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,751 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 03:21:02,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026569018] [2019-11-20 03:21:02,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873658121] [2019-11-20 03:21:02,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,753 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand 3 states. [2019-11-20 03:21:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,785 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-11-20 03:21:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 03:21:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,789 INFO L225 Difference]: With dead ends: 422 [2019-11-20 03:21:02,789 INFO L226 Difference]: Without dead ends: 420 [2019-11-20 03:21:02,790 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 03:21:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-20 03:21:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2019-11-20 03:21:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-20 03:21:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-11-20 03:21:02,808 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2019-11-20 03:21:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,808 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-11-20 03:21:02,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-11-20 03:21:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:21:02,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:21:02,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:21:02,811 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:21:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:21:02,825 INFO L82 PathProgramCache]: Analyzing trace with hash -110691082, now seen corresponding path program 1 times [2019-11-20 03:21:02,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:21:02,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639992920] [2019-11-20 03:21:02,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:21:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:21:02,860 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 03:21:02,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639992920] [2019-11-20 03:21:02,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:21:02,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:21:02,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460729501] [2019-11-20 03:21:02,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:21:02,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:21:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:21:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:21:02,863 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 3 states. [2019-11-20 03:21:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:21:02,910 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2019-11-20 03:21:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:21:02,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 03:21:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:21:02,911 INFO L225 Difference]: With dead ends: 852 [2019-11-20 03:21:02,911 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:21:02,914 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 03:21:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:21:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:21:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:21:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:21:02,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-20 03:21:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:21:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:21:02,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:21:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:21:02,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:21:02,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:21:02,947 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 03:21:02,947 INFO L447 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,948 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2019-11-20 03:21:02,949 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,949 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,949 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,949 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,951 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-20 03:21:02,951 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-20 03:21:02,951 INFO L444 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,951 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:21:02,951 INFO L447 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2019-11-20 03:21:02,952 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 03:21:02,952 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,952 INFO L447 ceAbstractionStarter]: At program point L92(lines 4 93) the Hoare annotation is: true [2019-11-20 03:21:02,952 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-20 03:21:02,952 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 03:21:02,952 INFO L440 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2019-11-20 03:21:02,952 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2019-11-20 03:21:02,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:21:02 BoogieIcfgContainer [2019-11-20 03:21:02,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:21:02,970 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:21:02,970 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:21:02,970 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:21:02,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:21:01" (3/4) ... [2019-11-20 03:21:02,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:21:02,994 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 03:21:02,995 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:21:03,093 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a8d2f810-eb99-44a1-ab44-834207ff8cda/bin/uautomizer/witness.graphml [2019-11-20 03:21:03,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:21:03,096 INFO L168 Benchmark]: Toolchain (without parser) took 2559.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 991.8 MB in the end (delta: -47.1 MB). Peak memory consumption was 86.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:21:03,097 INFO L168 Benchmark]: CDTParser took 0.48 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 03:21:03,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:21:03,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.30 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 03:21:03,098 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:21:03,099 INFO L168 Benchmark]: RCFGBuilder took 393.74 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.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:21:03,099 INFO L168 Benchmark]: TraceAbstraction took 1539.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:21:03,106 INFO L168 Benchmark]: Witness Printer took 123.96 ms. Allocated memory is still 1.2 GB. Free memory is still 991.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:21:03,108 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.48 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 405.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.30 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 40.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 393.74 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.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1539.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 112.8 MB). Peak memory consumption was 112.8 MB. Max. memory is 11.5 GB. * Witness Printer took 123.96 ms. Allocated memory is still 1.2 GB. Free memory is still 991.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 561 SDtfs, 264 SDslu, 345 SDs, 0 SdLazy, 69 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...