./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/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 56f043bec3037ec37b4a132611abd4a337934428 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:02:45,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:02:45,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:02:45,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:02:45,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:02:45,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:02:45,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:02:45,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:02:45,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:02:45,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:02:45,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:02:45,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:02:45,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:02:45,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:02:45,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:02:45,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:02:45,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:02:45,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:02:45,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:02:45,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:02:45,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:02:45,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:02:45,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:02:45,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:02:45,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:02:45,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:02:45,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:02:45,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:02:45,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:02:45,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:02:45,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:02:45,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:02:45,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:02:45,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:02:45,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:02:45,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:02:45,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:02:45,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:02:45,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:02:45,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:02:45,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:02:45,637 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:02:45,647 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:02:45,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:02:45,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:02:45,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:02:45,648 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:02:45,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:02:45,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:02:45,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:02:45,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:02:45,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:02:45,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:02:45,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:02:45,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:02:45,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:02:45,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:02:45,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:02:45,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:02:45,651 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_4e2e9186-fede-4af0-bbad-d6b5a7004097/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2019-12-07 16:02:45,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:02:45,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:02:45,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:02:45,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:02:45,767 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:02:45,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_11.c [2019-12-07 16:02:45,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/data/e1a3d7629/952507e9f3444973891530c631eb7220/FLAG71aba0546 [2019-12-07 16:02:46,169 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:02:46,170 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/sv-benchmarks/c/locks/test_locks_11.c [2019-12-07 16:02:46,174 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/data/e1a3d7629/952507e9f3444973891530c631eb7220/FLAG71aba0546 [2019-12-07 16:02:46,606 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/data/e1a3d7629/952507e9f3444973891530c631eb7220 [2019-12-07 16:02:46,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:02:46,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:02:46,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:46,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:02:46,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:02:46,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700ef669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46, skipping insertion in model container [2019-12-07 16:02:46,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:02:46,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:02:46,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:46,752 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:02:46,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:02:46,825 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:02:46,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46 WrapperNode [2019-12-07 16:02:46,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:02:46,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:46,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:02:46,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:02:46,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:02:46,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:02:46,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:02:46,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:02:46,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... [2019-12-07 16:02:46,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:02:46,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:02:46,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:02:46,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:02:46,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/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-12-07 16:02:46,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:02:46,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:02:47,090 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:02:47,091 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 16:02:47,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:47 BoogieIcfgContainer [2019-12-07 16:02:47,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:02:47,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:02:47,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:02:47,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:02:47,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:02:46" (1/3) ... [2019-12-07 16:02:47,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c936b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:47, skipping insertion in model container [2019-12-07 16:02:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:02:46" (2/3) ... [2019-12-07 16:02:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c936b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:02:47, skipping insertion in model container [2019-12-07 16:02:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:47" (3/3) ... [2019-12-07 16:02:47,096 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-12-07 16:02:47,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:02:47,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:02:47,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:02:47,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:02:47,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:02:47,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:02:47,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:02:47,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:02:47,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:02:47,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:02:47,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:02:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 16:02:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:02:47,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,144 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash -233107426, now seen corresponding path program 1 times [2019-12-07 16:02:47,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698341295] [2019-12-07 16:02:47,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698341295] [2019-12-07 16:02:47,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237157864] [2019-12-07 16:02:47,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,287 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-12-07 16:02:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,317 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2019-12-07 16:02:47,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:02:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,325 INFO L225 Difference]: With dead ends: 88 [2019-12-07 16:02:47,326 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:02:47,327 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-12-07 16:02:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:02:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2019-12-07 16:02:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 16:02:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 93 transitions. [2019-12-07 16:02:47,353 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 93 transitions. Word has length 17 [2019-12-07 16:02:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,354 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 93 transitions. [2019-12-07 16:02:47,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 93 transitions. [2019-12-07 16:02:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 16:02:47,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,354 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,355 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1244224676, now seen corresponding path program 1 times [2019-12-07 16:02:47,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845759888] [2019-12-07 16:02:47,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845759888] [2019-12-07 16:02:47,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733074734] [2019-12-07 16:02:47,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,389 INFO L87 Difference]: Start difference. First operand 50 states and 93 transitions. Second operand 3 states. [2019-12-07 16:02:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,405 INFO L93 Difference]: Finished difference Result 123 states and 228 transitions. [2019-12-07 16:02:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 16:02:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,407 INFO L225 Difference]: With dead ends: 123 [2019-12-07 16:02:47,407 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 16:02:47,409 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-12-07 16:02:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 16:02:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-12-07 16:02:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 16:02:47,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 133 transitions. [2019-12-07 16:02:47,418 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 133 transitions. Word has length 17 [2019-12-07 16:02:47,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,418 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 133 transitions. [2019-12-07 16:02:47,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 133 transitions. [2019-12-07 16:02:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:02:47,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817409, now seen corresponding path program 1 times [2019-12-07 16:02:47,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916080684] [2019-12-07 16:02:47,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916080684] [2019-12-07 16:02:47,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413103801] [2019-12-07 16:02:47,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,449 INFO L87 Difference]: Start difference. First operand 72 states and 133 transitions. Second operand 3 states. [2019-12-07 16:02:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,464 INFO L93 Difference]: Finished difference Result 113 states and 203 transitions. [2019-12-07 16:02:47,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:02:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,466 INFO L225 Difference]: With dead ends: 113 [2019-12-07 16:02:47,466 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 16:02:47,466 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-12-07 16:02:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 16:02:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-12-07 16:02:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 16:02:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 135 transitions. [2019-12-07 16:02:47,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 135 transitions. Word has length 18 [2019-12-07 16:02:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,472 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 135 transitions. [2019-12-07 16:02:47,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2019-12-07 16:02:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:02:47,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash 83953731, now seen corresponding path program 1 times [2019-12-07 16:02:47,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213097158] [2019-12-07 16:02:47,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213097158] [2019-12-07 16:02:47,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090151580] [2019-12-07 16:02:47,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,501 INFO L87 Difference]: Start difference. First operand 75 states and 135 transitions. Second operand 3 states. [2019-12-07 16:02:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,515 INFO L93 Difference]: Finished difference Result 144 states and 260 transitions. [2019-12-07 16:02:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:02:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,516 INFO L225 Difference]: With dead ends: 144 [2019-12-07 16:02:47,516 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 16:02:47,517 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-12-07 16:02:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 16:02:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 100. [2019-12-07 16:02:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 16:02:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 180 transitions. [2019-12-07 16:02:47,523 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 180 transitions. Word has length 18 [2019-12-07 16:02:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,524 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 180 transitions. [2019-12-07 16:02:47,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 180 transitions. [2019-12-07 16:02:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:02:47,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,525 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,525 INFO L82 PathProgramCache]: Analyzing trace with hash -927163519, now seen corresponding path program 1 times [2019-12-07 16:02:47,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999769733] [2019-12-07 16:02:47,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999769733] [2019-12-07 16:02:47,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337814673] [2019-12-07 16:02:47,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,549 INFO L87 Difference]: Start difference. First operand 100 states and 180 transitions. Second operand 3 states. [2019-12-07 16:02:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,560 INFO L93 Difference]: Finished difference Result 240 states and 434 transitions. [2019-12-07 16:02:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:02:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,562 INFO L225 Difference]: With dead ends: 240 [2019-12-07 16:02:47,562 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 16:02:47,562 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-12-07 16:02:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 16:02:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-12-07 16:02:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-07 16:02:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 254 transitions. [2019-12-07 16:02:47,569 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 254 transitions. Word has length 18 [2019-12-07 16:02:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,570 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 254 transitions. [2019-12-07 16:02:47,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 254 transitions. [2019-12-07 16:02:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:02:47,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,571 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-12-07 16:02:47,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1692188271, now seen corresponding path program 1 times [2019-12-07 16:02:47,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576919330] [2019-12-07 16:02:47,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576919330] [2019-12-07 16:02:47,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819407552] [2019-12-07 16:02:47,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,597 INFO L87 Difference]: Start difference. First operand 142 states and 254 transitions. Second operand 3 states. [2019-12-07 16:02:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,608 INFO L93 Difference]: Finished difference Result 215 states and 381 transitions. [2019-12-07 16:02:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:02:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,610 INFO L225 Difference]: With dead ends: 215 [2019-12-07 16:02:47,610 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 16:02:47,611 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-12-07 16:02:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 16:02:47,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-12-07 16:02:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 16:02:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 254 transitions. [2019-12-07 16:02:47,619 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 254 transitions. Word has length 19 [2019-12-07 16:02:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,619 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 254 transitions. [2019-12-07 16:02:47,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 254 transitions. [2019-12-07 16:02:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:02:47,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,621 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-12-07 16:02:47,621 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1322915347, now seen corresponding path program 1 times [2019-12-07 16:02:47,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453486388] [2019-12-07 16:02:47,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453486388] [2019-12-07 16:02:47,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070297184] [2019-12-07 16:02:47,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,644 INFO L87 Difference]: Start difference. First operand 144 states and 254 transitions. Second operand 3 states. [2019-12-07 16:02:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,655 INFO L93 Difference]: Finished difference Result 416 states and 736 transitions. [2019-12-07 16:02:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:02:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,657 INFO L225 Difference]: With dead ends: 416 [2019-12-07 16:02:47,657 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 16:02:47,658 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-12-07 16:02:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 16:02:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-12-07 16:02:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-07 16:02:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 482 transitions. [2019-12-07 16:02:47,666 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 482 transitions. Word has length 19 [2019-12-07 16:02:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,666 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 482 transitions. [2019-12-07 16:02:47,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 482 transitions. [2019-12-07 16:02:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:02:47,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,668 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-12-07 16:02:47,668 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1960934699, now seen corresponding path program 1 times [2019-12-07 16:02:47,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543257280] [2019-12-07 16:02:47,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543257280] [2019-12-07 16:02:47,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272630047] [2019-12-07 16:02:47,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,684 INFO L87 Difference]: Start difference. First operand 276 states and 482 transitions. Second operand 3 states. [2019-12-07 16:02:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,695 INFO L93 Difference]: Finished difference Result 352 states and 620 transitions. [2019-12-07 16:02:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:02:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,697 INFO L225 Difference]: With dead ends: 352 [2019-12-07 16:02:47,697 INFO L226 Difference]: Without dead ends: 350 [2019-12-07 16:02:47,697 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-12-07 16:02:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-07 16:02:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2019-12-07 16:02:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-07 16:02:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 478 transitions. [2019-12-07 16:02:47,704 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 478 transitions. Word has length 19 [2019-12-07 16:02:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,704 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 478 transitions. [2019-12-07 16:02:47,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 478 transitions. [2019-12-07 16:02:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:02:47,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,706 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1939083498, now seen corresponding path program 1 times [2019-12-07 16:02:47,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111160600] [2019-12-07 16:02:47,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111160600] [2019-12-07 16:02:47,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806482000] [2019-12-07 16:02:47,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,721 INFO L87 Difference]: Start difference. First operand 276 states and 478 transitions. Second operand 3 states. [2019-12-07 16:02:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,734 INFO L93 Difference]: Finished difference Result 516 states and 904 transitions. [2019-12-07 16:02:47,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:02:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,736 INFO L225 Difference]: With dead ends: 516 [2019-12-07 16:02:47,737 INFO L226 Difference]: Without dead ends: 514 [2019-12-07 16:02:47,737 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-12-07 16:02:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-12-07 16:02:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 384. [2019-12-07 16:02:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-07 16:02:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 654 transitions. [2019-12-07 16:02:47,745 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 654 transitions. Word has length 20 [2019-12-07 16:02:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,745 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 654 transitions. [2019-12-07 16:02:47,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 654 transitions. [2019-12-07 16:02:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:02:47,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1344766548, now seen corresponding path program 1 times [2019-12-07 16:02:47,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634368099] [2019-12-07 16:02:47,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634368099] [2019-12-07 16:02:47,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683937484] [2019-12-07 16:02:47,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,760 INFO L87 Difference]: Start difference. First operand 384 states and 654 transitions. Second operand 3 states. [2019-12-07 16:02:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,778 INFO L93 Difference]: Finished difference Result 916 states and 1568 transitions. [2019-12-07 16:02:47,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:02:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,782 INFO L225 Difference]: With dead ends: 916 [2019-12-07 16:02:47,782 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 16:02:47,783 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-12-07 16:02:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 16:02:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2019-12-07 16:02:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-07 16:02:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 906 transitions. [2019-12-07 16:02:47,799 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 906 transitions. Word has length 20 [2019-12-07 16:02:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,799 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 906 transitions. [2019-12-07 16:02:47,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 906 transitions. [2019-12-07 16:02:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:02:47,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,801 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 18167752, now seen corresponding path program 1 times [2019-12-07 16:02:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508731774] [2019-12-07 16:02:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508731774] [2019-12-07 16:02:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404339941] [2019-12-07 16:02:47,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,820 INFO L87 Difference]: Start difference. First operand 536 states and 906 transitions. Second operand 3 states. [2019-12-07 16:02:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,837 INFO L93 Difference]: Finished difference Result 812 states and 1368 transitions. [2019-12-07 16:02:47,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:02:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,840 INFO L225 Difference]: With dead ends: 812 [2019-12-07 16:02:47,841 INFO L226 Difference]: Without dead ends: 550 [2019-12-07 16:02:47,841 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-12-07 16:02:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-12-07 16:02:47,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2019-12-07 16:02:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-07 16:02:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 914 transitions. [2019-12-07 16:02:47,856 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 914 transitions. Word has length 21 [2019-12-07 16:02:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,856 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 914 transitions. [2019-12-07 16:02:47,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 914 transitions. [2019-12-07 16:02:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:02:47,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1261695926, now seen corresponding path program 1 times [2019-12-07 16:02:47,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143671986] [2019-12-07 16:02:47,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143671986] [2019-12-07 16:02:47,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284522254] [2019-12-07 16:02:47,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,876 INFO L87 Difference]: Start difference. First operand 548 states and 914 transitions. Second operand 3 states. [2019-12-07 16:02:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,895 INFO L93 Difference]: Finished difference Result 1000 states and 1692 transitions. [2019-12-07 16:02:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:02:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,901 INFO L225 Difference]: With dead ends: 1000 [2019-12-07 16:02:47,901 INFO L226 Difference]: Without dead ends: 998 [2019-12-07 16:02:47,902 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-12-07 16:02:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2019-12-07 16:02:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 772. [2019-12-07 16:02:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-12-07 16:02:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1258 transitions. [2019-12-07 16:02:47,923 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1258 transitions. Word has length 21 [2019-12-07 16:02:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,923 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1258 transitions. [2019-12-07 16:02:47,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1258 transitions. [2019-12-07 16:02:47,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:02:47,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash 2022154120, now seen corresponding path program 1 times [2019-12-07 16:02:47,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418506709] [2019-12-07 16:02:47,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:47,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418506709] [2019-12-07 16:02:47,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:47,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:47,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838307624] [2019-12-07 16:02:47,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:47,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:47,942 INFO L87 Difference]: Start difference. First operand 772 states and 1258 transitions. Second operand 3 states. [2019-12-07 16:02:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:47,962 INFO L93 Difference]: Finished difference Result 1816 states and 2972 transitions. [2019-12-07 16:02:47,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:47,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:02:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:47,967 INFO L225 Difference]: With dead ends: 1816 [2019-12-07 16:02:47,967 INFO L226 Difference]: Without dead ends: 1062 [2019-12-07 16:02:47,968 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-12-07 16:02:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-12-07 16:02:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1060. [2019-12-07 16:02:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-12-07 16:02:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1714 transitions. [2019-12-07 16:02:47,990 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1714 transitions. Word has length 21 [2019-12-07 16:02:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:47,991 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1714 transitions. [2019-12-07 16:02:47,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1714 transitions. [2019-12-07 16:02:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:02:47,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:47,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:47,993 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:47,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:47,993 INFO L82 PathProgramCache]: Analyzing trace with hash -457653655, now seen corresponding path program 1 times [2019-12-07 16:02:47,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:47,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400812711] [2019-12-07 16:02:47,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400812711] [2019-12-07 16:02:48,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608675077] [2019-12-07 16:02:48,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,009 INFO L87 Difference]: Start difference. First operand 1060 states and 1714 transitions. Second operand 3 states. [2019-12-07 16:02:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,032 INFO L93 Difference]: Finished difference Result 1592 states and 2564 transitions. [2019-12-07 16:02:48,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:02:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,039 INFO L225 Difference]: With dead ends: 1592 [2019-12-07 16:02:48,039 INFO L226 Difference]: Without dead ends: 1078 [2019-12-07 16:02:48,040 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-12-07 16:02:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-12-07 16:02:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1076. [2019-12-07 16:02:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-07 16:02:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1714 transitions. [2019-12-07 16:02:48,071 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1714 transitions. Word has length 22 [2019-12-07 16:02:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,072 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1714 transitions. [2019-12-07 16:02:48,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1714 transitions. [2019-12-07 16:02:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:02:48,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,073 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1737517333, now seen corresponding path program 1 times [2019-12-07 16:02:48,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663340078] [2019-12-07 16:02:48,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663340078] [2019-12-07 16:02:48,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963294260] [2019-12-07 16:02:48,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,092 INFO L87 Difference]: Start difference. First operand 1076 states and 1714 transitions. Second operand 3 states. [2019-12-07 16:02:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,121 INFO L93 Difference]: Finished difference Result 1928 states and 3124 transitions. [2019-12-07 16:02:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:02:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,132 INFO L225 Difference]: With dead ends: 1928 [2019-12-07 16:02:48,132 INFO L226 Difference]: Without dead ends: 1926 [2019-12-07 16:02:48,133 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-12-07 16:02:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-12-07 16:02:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1540. [2019-12-07 16:02:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-12-07 16:02:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2386 transitions. [2019-12-07 16:02:48,179 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2386 transitions. Word has length 22 [2019-12-07 16:02:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,179 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2386 transitions. [2019-12-07 16:02:48,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2386 transitions. [2019-12-07 16:02:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:02:48,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,182 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1546332713, now seen corresponding path program 1 times [2019-12-07 16:02:48,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926088205] [2019-12-07 16:02:48,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926088205] [2019-12-07 16:02:48,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50610010] [2019-12-07 16:02:48,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,197 INFO L87 Difference]: Start difference. First operand 1540 states and 2386 transitions. Second operand 3 states. [2019-12-07 16:02:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,236 INFO L93 Difference]: Finished difference Result 3592 states and 5588 transitions. [2019-12-07 16:02:48,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:02:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,245 INFO L225 Difference]: With dead ends: 3592 [2019-12-07 16:02:48,245 INFO L226 Difference]: Without dead ends: 2086 [2019-12-07 16:02:48,247 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-12-07 16:02:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-12-07 16:02:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2084. [2019-12-07 16:02:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-12-07 16:02:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 3202 transitions. [2019-12-07 16:02:48,302 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 3202 transitions. Word has length 22 [2019-12-07 16:02:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,302 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 3202 transitions. [2019-12-07 16:02:48,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 3202 transitions. [2019-12-07 16:02:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:02:48,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,304 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752253, now seen corresponding path program 1 times [2019-12-07 16:02:48,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771307857] [2019-12-07 16:02:48,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771307857] [2019-12-07 16:02:48,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352358535] [2019-12-07 16:02:48,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,318 INFO L87 Difference]: Start difference. First operand 2084 states and 3202 transitions. Second operand 3 states. [2019-12-07 16:02:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,350 INFO L93 Difference]: Finished difference Result 3128 states and 4788 transitions. [2019-12-07 16:02:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:02:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,359 INFO L225 Difference]: With dead ends: 3128 [2019-12-07 16:02:48,359 INFO L226 Difference]: Without dead ends: 2118 [2019-12-07 16:02:48,361 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-12-07 16:02:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-12-07 16:02:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2116. [2019-12-07 16:02:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-12-07 16:02:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 3202 transitions. [2019-12-07 16:02:48,399 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 3202 transitions. Word has length 23 [2019-12-07 16:02:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,399 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 3202 transitions. [2019-12-07 16:02:48,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 3202 transitions. [2019-12-07 16:02:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:02:48,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,401 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash 691888575, now seen corresponding path program 1 times [2019-12-07 16:02:48,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540978844] [2019-12-07 16:02:48,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540978844] [2019-12-07 16:02:48,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636290648] [2019-12-07 16:02:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,413 INFO L87 Difference]: Start difference. First operand 2116 states and 3202 transitions. Second operand 3 states. [2019-12-07 16:02:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,445 INFO L93 Difference]: Finished difference Result 3720 states and 5732 transitions. [2019-12-07 16:02:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:02:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,461 INFO L225 Difference]: With dead ends: 3720 [2019-12-07 16:02:48,461 INFO L226 Difference]: Without dead ends: 3718 [2019-12-07 16:02:48,462 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-12-07 16:02:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-12-07 16:02:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3076. [2019-12-07 16:02:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3076 states. [2019-12-07 16:02:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4514 transitions. [2019-12-07 16:02:48,519 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4514 transitions. Word has length 23 [2019-12-07 16:02:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,519 INFO L462 AbstractCegarLoop]: Abstraction has 3076 states and 4514 transitions. [2019-12-07 16:02:48,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4514 transitions. [2019-12-07 16:02:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:02:48,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,522 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash -319228675, now seen corresponding path program 1 times [2019-12-07 16:02:48,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066666898] [2019-12-07 16:02:48,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066666898] [2019-12-07 16:02:48,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739565636] [2019-12-07 16:02:48,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,534 INFO L87 Difference]: Start difference. First operand 3076 states and 4514 transitions. Second operand 3 states. [2019-12-07 16:02:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,585 INFO L93 Difference]: Finished difference Result 7112 states and 10468 transitions. [2019-12-07 16:02:48,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:02:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,600 INFO L225 Difference]: With dead ends: 7112 [2019-12-07 16:02:48,600 INFO L226 Difference]: Without dead ends: 4102 [2019-12-07 16:02:48,603 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-12-07 16:02:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-12-07 16:02:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 4100. [2019-12-07 16:02:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-12-07 16:02:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 5954 transitions. [2019-12-07 16:02:48,672 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 5954 transitions. Word has length 23 [2019-12-07 16:02:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,673 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 5954 transitions. [2019-12-07 16:02:48,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 5954 transitions. [2019-12-07 16:02:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:02:48,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,676 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -26075586, now seen corresponding path program 1 times [2019-12-07 16:02:48,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757847703] [2019-12-07 16:02:48,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757847703] [2019-12-07 16:02:48,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135849039] [2019-12-07 16:02:48,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,687 INFO L87 Difference]: Start difference. First operand 4100 states and 5954 transitions. Second operand 3 states. [2019-12-07 16:02:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,723 INFO L93 Difference]: Finished difference Result 6152 states and 8900 transitions. [2019-12-07 16:02:48,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:02:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,739 INFO L225 Difference]: With dead ends: 6152 [2019-12-07 16:02:48,739 INFO L226 Difference]: Without dead ends: 4166 [2019-12-07 16:02:48,741 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-12-07 16:02:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2019-12-07 16:02:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 4164. [2019-12-07 16:02:48,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4164 states. [2019-12-07 16:02:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5954 transitions. [2019-12-07 16:02:48,807 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5954 transitions. Word has length 24 [2019-12-07 16:02:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 4164 states and 5954 transitions. [2019-12-07 16:02:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5954 transitions. [2019-12-07 16:02:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:02:48,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,810 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1305939264, now seen corresponding path program 1 times [2019-12-07 16:02:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301469407] [2019-12-07 16:02:48,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:48,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301469407] [2019-12-07 16:02:48,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:48,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:48,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108086642] [2019-12-07 16:02:48,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:48,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:48,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:48,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:48,822 INFO L87 Difference]: Start difference. First operand 4164 states and 5954 transitions. Second operand 3 states. [2019-12-07 16:02:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:48,879 INFO L93 Difference]: Finished difference Result 7176 states and 10436 transitions. [2019-12-07 16:02:48,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:48,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:02:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:48,892 INFO L225 Difference]: With dead ends: 7176 [2019-12-07 16:02:48,892 INFO L226 Difference]: Without dead ends: 7174 [2019-12-07 16:02:48,893 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-12-07 16:02:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-12-07 16:02:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6148. [2019-12-07 16:02:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6148 states. [2019-12-07 16:02:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8514 transitions. [2019-12-07 16:02:48,985 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8514 transitions. Word has length 24 [2019-12-07 16:02:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:48,985 INFO L462 AbstractCegarLoop]: Abstraction has 6148 states and 8514 transitions. [2019-12-07 16:02:48,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8514 transitions. [2019-12-07 16:02:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:02:48,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:48,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:48,992 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1977910782, now seen corresponding path program 1 times [2019-12-07 16:02:48,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:48,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534397494] [2019-12-07 16:02:48,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:49,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534397494] [2019-12-07 16:02:49,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:49,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:49,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878595704] [2019-12-07 16:02:49,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:49,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:49,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:49,006 INFO L87 Difference]: Start difference. First operand 6148 states and 8514 transitions. Second operand 3 states. [2019-12-07 16:02:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:49,075 INFO L93 Difference]: Finished difference Result 14088 states and 19524 transitions. [2019-12-07 16:02:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:49,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:02:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:49,085 INFO L225 Difference]: With dead ends: 14088 [2019-12-07 16:02:49,085 INFO L226 Difference]: Without dead ends: 8070 [2019-12-07 16:02:49,090 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-12-07 16:02:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2019-12-07 16:02:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 8068. [2019-12-07 16:02:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8068 states. [2019-12-07 16:02:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8068 states to 8068 states and 11010 transitions. [2019-12-07 16:02:49,194 INFO L78 Accepts]: Start accepts. Automaton has 8068 states and 11010 transitions. Word has length 24 [2019-12-07 16:02:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:49,195 INFO L462 AbstractCegarLoop]: Abstraction has 8068 states and 11010 transitions. [2019-12-07 16:02:49,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8068 states and 11010 transitions. [2019-12-07 16:02:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:49,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:49,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:49,201 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1829196110, now seen corresponding path program 1 times [2019-12-07 16:02:49,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:49,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416242270] [2019-12-07 16:02:49,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:49,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416242270] [2019-12-07 16:02:49,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:49,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:49,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16330095] [2019-12-07 16:02:49,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:49,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:49,214 INFO L87 Difference]: Start difference. First operand 8068 states and 11010 transitions. Second operand 3 states. [2019-12-07 16:02:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:49,264 INFO L93 Difference]: Finished difference Result 12104 states and 16452 transitions. [2019-12-07 16:02:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:49,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:02:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:49,273 INFO L225 Difference]: With dead ends: 12104 [2019-12-07 16:02:49,273 INFO L226 Difference]: Without dead ends: 8198 [2019-12-07 16:02:49,276 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-12-07 16:02:49,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-12-07 16:02:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8196. [2019-12-07 16:02:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-07 16:02:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 11010 transitions. [2019-12-07 16:02:49,372 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 11010 transitions. Word has length 25 [2019-12-07 16:02:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:49,372 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 11010 transitions. [2019-12-07 16:02:49,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 11010 transitions. [2019-12-07 16:02:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:49,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:49,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:49,379 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1185907508, now seen corresponding path program 1 times [2019-12-07 16:02:49,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:49,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227028622] [2019-12-07 16:02:49,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:49,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227028622] [2019-12-07 16:02:49,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:49,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:49,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997225716] [2019-12-07 16:02:49,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:49,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:49,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:49,397 INFO L87 Difference]: Start difference. First operand 8196 states and 11010 transitions. Second operand 3 states. [2019-12-07 16:02:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:49,485 INFO L93 Difference]: Finished difference Result 13832 states and 18820 transitions. [2019-12-07 16:02:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:49,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:02:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:49,500 INFO L225 Difference]: With dead ends: 13832 [2019-12-07 16:02:49,500 INFO L226 Difference]: Without dead ends: 13830 [2019-12-07 16:02:49,502 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-12-07 16:02:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-12-07 16:02:49,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 12292. [2019-12-07 16:02:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12292 states. [2019-12-07 16:02:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12292 states to 12292 states and 16002 transitions. [2019-12-07 16:02:49,627 INFO L78 Accepts]: Start accepts. Automaton has 12292 states and 16002 transitions. Word has length 25 [2019-12-07 16:02:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:49,627 INFO L462 AbstractCegarLoop]: Abstraction has 12292 states and 16002 transitions. [2019-12-07 16:02:49,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12292 states and 16002 transitions. [2019-12-07 16:02:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:02:49,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:49,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:49,637 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash 174790258, now seen corresponding path program 1 times [2019-12-07 16:02:49,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:49,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431183702] [2019-12-07 16:02:49,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:49,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431183702] [2019-12-07 16:02:49,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:49,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:49,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274006457] [2019-12-07 16:02:49,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:49,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:49,649 INFO L87 Difference]: Start difference. First operand 12292 states and 16002 transitions. Second operand 3 states. [2019-12-07 16:02:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:49,766 INFO L93 Difference]: Finished difference Result 27912 states and 36228 transitions. [2019-12-07 16:02:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:49,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:02:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:49,791 INFO L225 Difference]: With dead ends: 27912 [2019-12-07 16:02:49,791 INFO L226 Difference]: Without dead ends: 15878 [2019-12-07 16:02:49,803 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-12-07 16:02:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2019-12-07 16:02:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 15876. [2019-12-07 16:02:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15876 states. [2019-12-07 16:02:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15876 states to 15876 states and 20226 transitions. [2019-12-07 16:02:50,026 INFO L78 Accepts]: Start accepts. Automaton has 15876 states and 20226 transitions. Word has length 25 [2019-12-07 16:02:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:50,026 INFO L462 AbstractCegarLoop]: Abstraction has 15876 states and 20226 transitions. [2019-12-07 16:02:50,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 15876 states and 20226 transitions. [2019-12-07 16:02:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:02:50,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:50,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:50,035 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1891357165, now seen corresponding path program 1 times [2019-12-07 16:02:50,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:50,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592612245] [2019-12-07 16:02:50,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02: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-12-07 16:02:50,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592612245] [2019-12-07 16:02:50,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:50,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:50,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675360232] [2019-12-07 16:02:50,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:50,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:50,048 INFO L87 Difference]: Start difference. First operand 15876 states and 20226 transitions. Second operand 3 states. [2019-12-07 16:02:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:50,136 INFO L93 Difference]: Finished difference Result 23816 states and 30212 transitions. [2019-12-07 16:02:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:50,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:02:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:50,157 INFO L225 Difference]: With dead ends: 23816 [2019-12-07 16:02:50,157 INFO L226 Difference]: Without dead ends: 16134 [2019-12-07 16:02:50,163 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-12-07 16:02:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16134 states. [2019-12-07 16:02:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16134 to 16132. [2019-12-07 16:02:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16132 states. [2019-12-07 16:02:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16132 states to 16132 states and 20226 transitions. [2019-12-07 16:02:50,321 INFO L78 Accepts]: Start accepts. Automaton has 16132 states and 20226 transitions. Word has length 26 [2019-12-07 16:02:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:50,321 INFO L462 AbstractCegarLoop]: Abstraction has 16132 states and 20226 transitions. [2019-12-07 16:02:50,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 16132 states and 20226 transitions. [2019-12-07 16:02:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:02:50,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:50,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:50,331 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1123746453, now seen corresponding path program 1 times [2019-12-07 16:02:50,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:50,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949872837] [2019-12-07 16:02:50,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:50,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949872837] [2019-12-07 16:02:50,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:50,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:50,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509778414] [2019-12-07 16:02:50,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:50,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:50,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:50,342 INFO L87 Difference]: Start difference. First operand 16132 states and 20226 transitions. Second operand 3 states. [2019-12-07 16:02:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:50,545 INFO L93 Difference]: Finished difference Result 26632 states and 33540 transitions. [2019-12-07 16:02:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:50,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:02:50,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:50,582 INFO L225 Difference]: With dead ends: 26632 [2019-12-07 16:02:50,583 INFO L226 Difference]: Without dead ends: 26630 [2019-12-07 16:02:50,585 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-12-07 16:02:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26630 states. [2019-12-07 16:02:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26630 to 24580. [2019-12-07 16:02:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24580 states. [2019-12-07 16:02:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24580 states to 24580 states and 29954 transitions. [2019-12-07 16:02:50,827 INFO L78 Accepts]: Start accepts. Automaton has 24580 states and 29954 transitions. Word has length 26 [2019-12-07 16:02:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:50,827 INFO L462 AbstractCegarLoop]: Abstraction has 24580 states and 29954 transitions. [2019-12-07 16:02:50,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 24580 states and 29954 transitions. [2019-12-07 16:02:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:02:50,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:50,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:50,847 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:50,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash 112629203, now seen corresponding path program 1 times [2019-12-07 16:02:50,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:50,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549789839] [2019-12-07 16:02:50,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:50,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549789839] [2019-12-07 16:02:50,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:50,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:50,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497158284] [2019-12-07 16:02:50,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:50,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:50,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:50,859 INFO L87 Difference]: Start difference. First operand 24580 states and 29954 transitions. Second operand 3 states. [2019-12-07 16:02:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:51,090 INFO L93 Difference]: Finished difference Result 55304 states and 66820 transitions. [2019-12-07 16:02:51,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:51,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:02:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:51,129 INFO L225 Difference]: With dead ends: 55304 [2019-12-07 16:02:51,129 INFO L226 Difference]: Without dead ends: 31238 [2019-12-07 16:02:51,144 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-12-07 16:02:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2019-12-07 16:02:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 31236. [2019-12-07 16:02:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31236 states. [2019-12-07 16:02:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31236 states to 31236 states and 36866 transitions. [2019-12-07 16:02:51,572 INFO L78 Accepts]: Start accepts. Automaton has 31236 states and 36866 transitions. Word has length 26 [2019-12-07 16:02:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:51,572 INFO L462 AbstractCegarLoop]: Abstraction has 31236 states and 36866 transitions. [2019-12-07 16:02:51,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31236 states and 36866 transitions. [2019-12-07 16:02:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:02:51,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:51,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:51,585 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 476617767, now seen corresponding path program 1 times [2019-12-07 16:02:51,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:51,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688459925] [2019-12-07 16:02:51,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:51,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688459925] [2019-12-07 16:02:51,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:51,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:51,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292119781] [2019-12-07 16:02:51,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:51,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:51,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:51,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:51,600 INFO L87 Difference]: Start difference. First operand 31236 states and 36866 transitions. Second operand 3 states. [2019-12-07 16:02:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:51,846 INFO L93 Difference]: Finished difference Result 46856 states and 55044 transitions. [2019-12-07 16:02:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:51,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:02:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:51,893 INFO L225 Difference]: With dead ends: 46856 [2019-12-07 16:02:51,893 INFO L226 Difference]: Without dead ends: 31750 [2019-12-07 16:02:51,901 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-12-07 16:02:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31750 states. [2019-12-07 16:02:52,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31750 to 31748. [2019-12-07 16:02:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-12-07 16:02:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 36866 transitions. [2019-12-07 16:02:52,428 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 36866 transitions. Word has length 27 [2019-12-07 16:02:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:52,428 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 36866 transitions. [2019-12-07 16:02:52,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 36866 transitions. [2019-12-07 16:02:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:02:52,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:52,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:52,441 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash -803245911, now seen corresponding path program 1 times [2019-12-07 16:02:52,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:52,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417334238] [2019-12-07 16:02:52,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:52,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417334238] [2019-12-07 16:02:52,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:52,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:52,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553365256] [2019-12-07 16:02:52,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:52,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:52,453 INFO L87 Difference]: Start difference. First operand 31748 states and 36866 transitions. Second operand 3 states. [2019-12-07 16:02:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:52,830 INFO L93 Difference]: Finished difference Result 92166 states and 104451 transitions. [2019-12-07 16:02:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:52,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:02:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:52,880 INFO L225 Difference]: With dead ends: 92166 [2019-12-07 16:02:52,880 INFO L226 Difference]: Without dead ends: 31748 [2019-12-07 16:02:52,897 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-12-07 16:02:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2019-12-07 16:02:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 31748. [2019-12-07 16:02:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31748 states. [2019-12-07 16:02:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31748 states to 31748 states and 34818 transitions. [2019-12-07 16:02:53,386 INFO L78 Accepts]: Start accepts. Automaton has 31748 states and 34818 transitions. Word has length 27 [2019-12-07 16:02:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:53,386 INFO L462 AbstractCegarLoop]: Abstraction has 31748 states and 34818 transitions. [2019-12-07 16:02:53,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 31748 states and 34818 transitions. [2019-12-07 16:02:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:02:53,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:02:53,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:02:53,402 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:02:53,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:02:53,402 INFO L82 PathProgramCache]: Analyzing trace with hash 207871339, now seen corresponding path program 1 times [2019-12-07 16:02:53,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:02:53,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289569688] [2019-12-07 16:02:53,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:02:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:02:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:02:53,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289569688] [2019-12-07 16:02:53,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:02:53,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:02:53,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251595811] [2019-12-07 16:02:53,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:02:53,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:02:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:02:53,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:02:53,420 INFO L87 Difference]: Start difference. First operand 31748 states and 34818 transitions. Second operand 3 states. [2019-12-07 16:02:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:02:53,580 INFO L93 Difference]: Finished difference Result 31748 states and 34818 transitions. [2019-12-07 16:02:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:02:53,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:02:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:02:53,581 INFO L225 Difference]: With dead ends: 31748 [2019-12-07 16:02:53,581 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:02:53,588 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-12-07 16:02:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:02:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:02:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:02:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:02:53,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-12-07 16:02:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:02:53,589 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:02:53,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:02:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:02:53,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:02:53,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:02:53,604 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 16:02:53,604 INFO L249 CegarLoopResult]: At program point L176(lines 4 177) the Hoare annotation is: true [2019-12-07 16:02:53,604 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-12-07 16:02:53,604 INFO L246 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-12-07 16:02:53,604 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 16:02:53,604 INFO L242 CegarLoopResult]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-12-07 16:02:53,604 INFO L246 CegarLoopResult]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,605 INFO L246 CegarLoopResult]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 16:02:53,606 INFO L249 CegarLoopResult]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-12-07 16:02:53,606 INFO L246 CegarLoopResult]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L246 CegarLoopResult]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-12-07 16:02:53,607 INFO L249 CegarLoopResult]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-12-07 16:02:53,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:02:53 BoogieIcfgContainer [2019-12-07 16:02:53,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:02:53,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:02:53,617 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:02:53,617 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:02:53,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:02:47" (3/4) ... [2019-12-07 16:02:53,620 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:02:53,631 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 16:02:53,631 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:02:53,669 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4e2e9186-fede-4af0-bbad-d6b5a7004097/bin/uautomizer/witness.graphml [2019-12-07 16:02:53,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:02:53,671 INFO L168 Benchmark]: Toolchain (without parser) took 7061.03 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 907.5 MB). Free memory was 943.6 MB in the beginning and 1.4 GB in the end (delta: -414.0 MB). Peak memory consumption was 493.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,671 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:53,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:53,672 INFO L168 Benchmark]: Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:02:53,672 INFO L168 Benchmark]: RCFGBuilder took 221.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,672 INFO L168 Benchmark]: TraceAbstraction took 6524.45 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 802.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -312.7 MB). Peak memory consumption was 490.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,673 INFO L168 Benchmark]: Witness Printer took 52.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:02:53,674 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6524.45 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 802.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -312.7 MB). Peak memory consumption was 490.0 MB. Max. memory is 11.5 GB. * Witness Printer took 52.75 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 42 locations, 1 error locations. Result: SAFE, OverallTime: 6.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2722 SDtfs, 1400 SDslu, 1804 SDs, 0 SdLazy, 163 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31748occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 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.3s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 31360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...